给定一个包含 m x n 个元素的矩阵(m 行, n 列),请按照顺时针螺旋顺序,返回矩阵中的所有元素。
示例 1:
输入:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
输出: [1,2,3,6,9,8,7,4,5]
示例 2:
输入:
[
[1, 2, 3, 4],
[5, 6, 7, 8],
[9,10,11,12]
]
输出: [1,2,3,4,8,12,11,10,9,5,6,7]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/spiral-matrix
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public int[][] generateMatrix(int n) {
int[][] matrix = new int[n][n];
int count = 1;
for(int i = 0; i < n/2; i++){
for(int j = i; j <n-i-1; j++){
matrix[i][j] = count++;
}
for(int j = i; j < n-i-1; j++) {
matrix[j][n-1-i] = count++;
}
for(int j = i; j < n-i-1; j++) {
matrix[n-1-i][n-1-j] = count++;
}
for(int j = i; j < n-i-1; j++) {
matrix[n-1-j][i] = count++;
}
}
if(n%2==1) matrix[n/2][n/2] = count;
return matrix;
}
}