聲明C函數(shù)以返回?cái)?shù)組如何創(chuàng)建返回?cái)?shù)組的函數(shù)？我試過這個(gè)const int WIDTH=11;const int HEIGHT=11;int main() {
char A[WIDTH][HEIGHT];
A=rand_grid(WIDTH,HEIGHT);
return 0;}// Initializes a random board.char[][] rand_grid(int i, int k) {
char* A[i][k];
for(j=0;j<i;++j) {
for(l=0;l<k;++l) {
A[j][l]=ran(10);
}
}
return A;}// Returns a random number from the set {0,...,9}.int ran(int i) {
srand((unsigned int) time(0));
return(rand()%10);}
char (*foo(int width))[HEIGHT]{
/**
* dynamically allocate memory for a widthxHEIGHT array of char
*/
char (*newArr)[HEIGHT] = malloc(sizeof *newArr * width);
/**
* initialize array contents here
*/
return newArr;}
語法有點(diǎn)混亂，它是
foo -- foo
foo(int width) -- is a function -- taking an int parameter *foo(int width) -- returning a pointer (*foo(int width))[HEIGHT] -- to a HEIGHT-element arraychar (*foo(int width))[HEIGHT] -- of char
void rand_grid(char *base, size_t rows, size_t cols){
size_t i, j;
for (i = 0; i < rows; i++)
{
for (j = 0; j < cols; j++)
{
/**
* Since base is a simple char *, we must index it
* as though it points to a 1-d array. This works if
* base points to the first element of a 2-d array,
* since multi-dimensional arrays are contiguous.
*/
base[i*cols+j] = initial_value();
}
}}int main(void){
char A[WIDTH][HEIGHT];
rand_grid(&A[0][0], WIDTH, HEIGHT);
...}
