题目描述
给你一个正整数 n ,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。
示例 1:
输入:n = 3
输出:[[1,2,3],[8,9,4],[7,6,5]]
示例 2:
输入:n = 1
输出:[[1]]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/spiral-matrix-ii
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
我的代码
先外圈再内圈
class Solution {
public int[][] generateMatrix(int n) {
int[][] ans = new int[n][n];
int start = 1;
int row = 0;
while (n > 0) {
for (int j = row; j - row + 1 <= n; j++) {
ans[row][j] = start;
start ++;
}
for (int i = row + 1;i - row + 1 <= n; i++) {
ans[i][row + n -1] = start;
start ++;
}
for (int a = row + n - 2;a >= row ; a --) {
ans[row + n - 1][a] = start;
start ++;
}
for (int b = row + n - 2;b > row ; b --) {
ans[b][row] = start;
start ++;
}
row ++;
n -= 2;
}
return ans;
}
}
答案
class Solution {
public int[][] generateMatrix(int n) {
int num = 1;
int[][] matrix = new int[n][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-Solution
链接:https://leetcode-cn.com/problems/spiral-matrix-ii/solution/luo-xuan-ju-zhen-ii-by-leetcode-solution-f7fp/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。