c - 将二维数组从函数返回到主函数
问题描述
我正在为 Game of Life 编写代码,并且按照我的分配规定,我不应该使用指针。
为了计算每个单元格的邻居数量,这里的单元格是我的二维数组上的一个坐标,我编写了一个函数,它遍历所有行和列并计算每个单元格有多少个 ALIVE 邻居。最大值为 8。
但是我不知道如何返回我的数组,它将相邻单元格的数量存储在 20x20 数组中。
下面是整个代码。请注意,有些部分未完成,因为我正在补充给我的模板。
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
/* Constants, representation of states */
#define ALIVE 'X'
#define DEAD '.'
/* Declaration of data structure */
typedef struct{
char current;
char next;
} cell;
/* Declaration of functions */
void initField(const int rows, const int cols, cell field[rows][cols]);
void loadGlider(const int rows, const int cols, cell field[rows][cols]);
void loadSemaphore(const int rows, const int cols, cell field[rows][cols]);
void loadRandom(const int rows, const int cols, cell field[rows][cols]);
void loadCustom(const int rows, const int cols, cell field[rows][cols]);
void printWorld(const int rows, const int cols, cell field[rows][cols]);
int CellNeighbour(const int rows, const int cols, cell field[rows][cols]);
/* Function: main
* Description: Start and run games, interact with the user.
* Input: About what initial structure and whether to step or exit.
* Output: Information to the user, and the game field in each step.
*/
int main(void) {
const int rows = 20;
const int cols = 20;
cell field[rows][cols];
int counting[rows][cols];
initField(rows,cols, field);
printWorld(rows,cols,field);
CellNeighbour(rows,cols,field);//test
for (int i = 0; i < rows; i++){
for (int j = 0; j < cols; j++){
printf("%d ", counting[i][j]);
}
printf("\n");
}
return 0;
}
/* Function: initField
* Description: Initialize all the cells to dead, then asks the user about
* which structure to load, and finally load the structure.
* Input: The field array and its size.
* Output: The field array is updated.
*/
void initField(const int rows, const int cols, cell field[rows][cols]) {
for (int r = 0 ; r < rows ; r++) {
for (int c = 0 ; c < cols ; c++) {
field[r][c].current = DEAD;
}
}
printf("Select field spec to load ([G]lider, [S]emaphore, [R]andom ");
printf("or [C]ustom): ");
int ch = getchar();
/* Ignore following newline */
if (ch != '\n') {
getchar();
}
switch (ch) {
case 'g':
case 'G':
loadGlider(rows, cols, field);
break;
case 's':
case 'S':
loadSemaphore(rows, cols, field);
break;
case 'r':
case 'R':
loadRandom(rows, cols, field);
break;
case 'c':
case 'C':
default:
loadCustom(rows, cols, field);
break;
}
}
/* Function: loadGlider
* Description: Inserts a glider into the field.
* Input: The field array and its size.
* Output: The field array is updated.
*/
void loadGlider(const int rows, const int cols, cell field[rows][cols]) {
field[0][1].current = ALIVE;
field[1][2].current = ALIVE;
field[2][0].current = ALIVE;
field[2][1].current = ALIVE;
field[2][2].current = ALIVE;
}
/* Function: loadSemaphore
* Description: Inserts a semaphore into the field.
* Input: The field array and its size.
* Output: The field array is updated.
*/
void loadSemaphore(const int rows, const int cols, cell field[rows][cols]) {
field[8][1].current = ALIVE;
field[8][2].current = ALIVE;
field[8][3].current = ALIVE;
}
/* Function: loadRandom
* Description: Inserts a random structure into the field.
* Input: The field array and its size.
* Output: The field array is updated. There is a 50 % chance that a cell
* is alive.
*/
void loadRandom(const int rows, const int cols, cell field[rows][cols]) {
}
/* Function: loadCustom
* Description: Lets the user specify a structure that then is inserted into
* the field.
* Input: The field array and its size.
* Output: The field array is updated.
*/
void loadCustom(const int rows, const int cols, cell field[rows][cols]) {
printf("Give custom format string: ");
do {
int r, c;
scanf("%d,%d", &r, &c);
field[r][c].current = ALIVE;
} while (getchar() != '\n');
}
/* Function: printWorld
* Description: Prints the current field
* Input: The field array and its size.
* Output: The field array is updated.
*/
void printWorld(const int rows, const int cols, cell field[rows][cols]){
char c = '\n';
while(c == '\n'){
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
printf("%c ", field[i][j].current);
}
printf("\n");
}
c = getchar();
if(c != '\n'){
break; // hoppa ut ur loopen till main funktionen
}
}
}
void evolve(const int rows,const int cols,cell field[rows][cols]){
for(int i = 0;i<rows;i++){
for(int j =0;j<cols;j++){
if(field[rows][cols].current == ALIVE && ArrayDatCorresponds2NmbofNeighb[rows][cols]<2){
}
if(field[rows][cols].current == ALIVE && ArrayDatCorresponds2NmbofNeighb[rows][cols] ==3 ||ArrayDatCorresponds2NmbofNeighb[rows][cols] ==2 ){
field[rows][cols].next = ALIVE;
}
if(field[rows][cols].current == ALIVE && ArrayDatCorresponds2NmbofNeighb[rows][cols] >= 4 ){
field[rows][cols].next = DEAD;
}
if(field[rows][cols].current == DEAD && ArrayDatCorresponds2NmbofNeighb[rows][cols] ==3){
field[rows][cols].next = ALIVE;
}
}
}
int CellNeighbour(const int rows, const int cols, cell field[rows][cols]){
int i,j;
int count =0;
for( i =0;i<rows;i++){
for( j = 0;j<cols;j++){
int StoreArray[rows][cols] =0;
}
}
for( i =0;i<rows;i++){
for( j = 0;j<cols;j++){
if(field[rows-1][cols-1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows][cols-1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows+1][cols-1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows+1][cols].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows+1][cols+1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows][cols+1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows-1][cols+1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows-1][cols].current == ALIVE){
StoreArray[i][j]=count++;
}
}
}
return StoreArray;
}
以下是我遇到问题的功能:
int CellNeighbour(const int rows, const int cols, cell field[rows][cols]){
int i,j;
int count =0;
for( i =0;i<rows;i++){
for( j = 0;j<cols;j++){
int StoreArray[rows][cols] =0;
}
}
for( i =0;i<rows;i++){
for( j = 0;j<cols;j++){
if(field[rows-1][cols-1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows][cols-1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows+1][cols-1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows+1][cols].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows+1][cols+1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows][cols+1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows-1][cols+1].current == ALIVE){
StoreArray[i][j]=count++;
}
if(field[rows-1][cols].current == ALIVE){
StoreArray[i][j]=count++;
}
}
}
return StoreArray;
}
如果我初始化一个 20x20 的字段,其中有一些 ALIVE 单元格。
然后我希望,在打印出一个 5x5(只是为了简单起见)计算每个单元格有多少个邻居之后,一个看起来像这样的网格:
2 2 0 0 0
2 3 0 0 0
0 0 0 0 0
0 1 1 0 0
0 0 0 0 0
解决方案
您不能在 C 中返回数组。而且由于不允许使用指针,因此您必须将数组包装在结构中。例子:
typedef struct {
int data[rows][cols];
} MyStruct;
MyStruct func()
{
MyStruct my_struct;
// Fill my_struct.data with what you need.
// ...
return my_struct;
}
推荐阅读
- javascript - 在 d3 中难以将 json 字符串转换为日期格式
- c# - 合并数组(带偏移的叠加)
- java - JAVA,SWT我在封闭范围内定义的局部变量必须是最终的或有效的最终
- sql - 如何计算分组的四分位数?
- android - Android kotlin - 上传带有 Volley 错误的图像:意外覆盖:以下声明具有相同的 JVM 签名
- amazon-web-services - API Gateway 在生产环境中偶尔会出现 5XX 错误
- javascript - 鼠标在 div 上向左或向右移动时迭代数组
- android - 请问我该如何解决这个问题
- php - 从数组 PHP 中获取值 - 非法偏移
- python - 屏蔽像素值列表中存在被屏蔽像素的图像