题目
leetcode 59
给定一个正整数 n,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。
示例:
输入: 3
输出:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
代码
确定左右上下边界即可
int** generateMatrix(int n, int* returnSize, int** returnColumnSizes){
int **res = (int **)malloc(sizeof(int *) * n);
(*returnColumnSizes) = (int *)malloc(sizeof(int) * n);
for (int i = 0; i < n; i++) {
res[i] = (int *)malloc(sizeof(int) * n);
(*returnColumnSizes)[i] = n;
}
*returnSize = n;
int l = 0, r = n - 1, s = 0, x = n - 1, count = 1;
while (l <= r) {
for (int i = l; i <= r; i++) res[s][i] = count++;
s++;
for (int i = s; i <= x; i++) res[i][r] = count++;
r--;
for (int i = r; i >= l; i--) res[x][i] = count++;
x--;
for (int i = x; i >= s; i--) res[i][l] = count++;
l++;
}
return res;
}