解题思路
用不同的索引来控制螺旋的次数和位置
代码
/**
* Return an array of arrays of size *returnSize.
* The sizes of the arrays are returned as *returnColumnSizes array.
* Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
*/
int** generateMatrix(int n, int* returnSize, int** returnColumnSizes){
int** res = malloc(sizeof(int*) * n);
* returnSize = n;
* returnColumnSizes = malloc(sizeof(int) * n);
for(int i = 0; i < n; i++){//初始化
res[i] = malloc(sizeof(int) * n);
memset(res[i], 0, sizeof(int) * n);
(*returnColumnSizes)[i] = n;
}
int cur = 1;
int flag = 1;//为0从行开始,为1从列开始
int startx = 0, starty = 0;//开始的位置
int i = 0, j = 0;//索引
int loop = n / 2;
while(loop--)//一共需要转n/2圈,一次循环实现打印一圈。n为奇数的话要在最后在矩阵中间加上一个n的平方
{ j = starty;
i = startx;
//打印上侧,从左到右
for(;j<n-flag;j++)
{
res[startx][j] = cur++;
}
//打印右侧,从上到下
for(;i<n-flag;i++)
{
res[i][j] = cur++;
}
//打印下侧,从右到左
for(;j>starty;j--)
{
res[i][j] = cur++;
}
//打印左侧,从下到上
for(;i>startx;i--)
{
res[i][j] = cur++;
}
flag = flag + 1;//打印完一圈后,终止位置要-1,则offset要+1
//起始位置加一
startx++;
starty++;
}
if(n % 2 == 1){
res[n/2][n/2] = cur;
}
return res;
}