-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathSpiralMatrix2.java
More file actions
58 lines (57 loc) · 1.49 KB
/
SpiralMatrix2.java
File metadata and controls
58 lines (57 loc) · 1.49 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
package array_and_matrix;
/**
* @Author: Wenhang Chen
* @Description:给定一个正整数 n,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。.
* 输入: 3
* 输出:
* [
* [ 1, 2, 3 ],
* [ 8, 9, 4 ],
* [ 7, 6, 5 ]
* ]
* @Date: Created in 21:18 11/25/2019
* @Modified by:
*/
public class SpiralMatrix2 {
public int[][] generateMatrix(int n) {
if (n <= 0) return null;
int[][] matrix = new int[n][n];
int flagNum = 0;
int maxNum = n * n;
int i = 0, j = 0;
int r1 = 0, r2 = 0, r3 = 0, r4 = 0;
while (flagNum < maxNum) {
// 每次都要判断是否已遍历完
for (; j < n - r1 && flagNum < maxNum; j++) {
flagNum++;
matrix[i][j] = flagNum;
}
// 注意要复位
r4++;
j--;
i++;
for (; i < n - r2 && flagNum < maxNum; i++) {
flagNum++;
matrix[i][j] = flagNum;
}
r1++;
i--;
j--;
for (; j >= r3 && flagNum < maxNum; j--) {
flagNum++;
matrix[i][j] = flagNum;
}
r2++;
j++;
i--;
for (; i >= r4 && flagNum < maxNum; i--) {
flagNum++;
matrix[i][j] = flagNum;
}
r3++;
i++;
j++;
}
return matrix;
}
}