根据代码随想录的路线学习算法——记录对自己来说比较难理解的题:
题目如下:
给你一个正整数 n ,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。
示例 1:
输入:n = 3 输出:[[1,2,3],[8,9,4],[7,6,5]] 示例 2:
输入:n = 1 输出:[[1]]
提示:
1 <= n <= 20
先将解题代码附上:
/**
* 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 num = 1;
int** matrix = malloc(sizeof(int*) * n);
*returnSize = n;
*returnColumnSizes = malloc(sizeof(int) * n);
for (int i = 0; i < n; i++) {
matrix[i] = malloc(sizeof(int) * n);
memset(matrix[i], 0, sizeof(int) * n);
(*returnColumnSizes)[i] = n;
}
int left = 0, right = n - 1, top = 0, bottom = n - 1;
while (left <= right && top <= bottom) {
for (int column = left; column <= right; column++) { //右
matrix[top][column] = num;
num++;
}
for (int row = top + 1; row <= bottom; row++) { //下
matrix[row][right] = num;
num++;
}
if (left < right && top < bottom) {
for (int column = right - 1; column > left; column--) { //左
matrix[bottom][column] = num;
num++;
}
for (int row = bottom; row > top; row--) { //上
matrix[row][left] = num;
num++;
}
}
left++;
right--;
top++;
bottom--;
}
return matrix;
}
我认为这道题的逻辑并不难,而难度在于使用代码将逻辑写出来,比较容易使人烦躁,还有就是LeetCode对于数组的传递比较难理解,就是在函数前的一段注释,需要改变returnSize与returncolumnSizes的值并为每一个值用malloc扩展空间。
这道题我得多复习几遍。