题目描述:
给定一个正整数 n,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。
示例:
输入: 3
输出:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
题目解答:
方法1:遍历
按顺序放置数字,上边,右边,下边,左边。
运行时间0ms,代码如下。
/**
* Return an array of arrays.
* Note: The returned array must be malloced, assume caller calls free().
*/
int** generateMatrix(int n) {
int i = 0;
int** result = (int**)malloc(n * sizeof(int*));
for(i = 0; i < n; i++)
result[i] = (int*)malloc(n * sizeof(int));
int t = 1, row_start = 0, col_start = 0, row_end = n, col_end = n;
int end = n * n;
while(t <= end) {
for(i = col_start; i < col_end; i++)
result[row_start][i] = (t++);
row_start++;
for(i = row_start; i < row_end; i++)
result[i][row_end - 1] = (t++);
col_end--;
for(i = col_end - 1; i >= col_start; i--)
result[row_end - 1][i] = (t++);
row_end--;
for(i = row_end - 1; i >= row_start; i--)
result[i][col_start] = (t++);
col_start++;
}
return result;
}