问题描述
地址:https://leetcode.com/problems/spiral-matrix-ii/
描述:
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
For example,
Given n = 3,
You should return the following matrix:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
翻译:给出一个int n,螺旋产生一个1~n2的二维矩阵。
问题解析
这个题目感觉没什么可分析的,直接看代码吧,主要关注螺旋打印。
解析代码
public class Solution {
public int[][] generateMatrix(int n) {
int[][] matrix = new int[n][n];
int start = 0;
int end = n -1;
int num = 1;
while (start < end){
for(int i = start; i<end; i++){
matrix[start][i] = num;
num++;
}
for(int i =start; i < end; i++){
matrix[i][end] = num;
num++;
}
for(int i = end; i> start; i--){
matrix[end][i] = num;
num++;
}
for(int i=end; i > start; i--){
matrix[i][start] = num;
num++;
}
start++;
end--;
}
if(start == end){
matrix[start][end] = num;
}
return matrix;
}
}