forked from xiaoyaoworm/Leetcode-java
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path59_generateMatrix.java
84 lines (79 loc) · 2.06 KB
/
59_generateMatrix.java
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
//Same as Spiral Matrix I, easy understanding
public class Solution {
public int[][] generateMatrix(int n) {
int[][] res = new int[n][n];
int rowStart = 0;
int rowEnd = n-1;
int colStart = 0;
int colEnd = n-1;
int num = 1;
while(rowStart<= rowEnd && colStart <= colEnd){
for(int i = colStart; i <= colEnd; i++){
res[rowStart][i] = num;
num++;
}
rowStart++;
for(int i = rowStart; i<= rowEnd; i++){
res[i][colEnd] = num;
num++;
}
colEnd--;
if(rowStart<= rowEnd){
for(int i = colEnd; i>= colStart; i--){
res[rowEnd][i] = num;
num++;
}
rowEnd--;
}
if(colStart<= colEnd){
for(int i = rowEnd; i>= rowStart; i--){
res[i][colStart] = num;
num++;
}
colStart++;
}
}
return res;
}
}
public class Solution {
public int[][] generateMatrix(int n) {
int[][] result = new int[n][n];
int x = 0;
int y = 0;
int step = 0;
int k = 1;
while(k<= n*n){
while(y+step<n){ // Be careful for all the conditions!!!!
result[x][y] = k;
y++;
k++;
}
y--;
x++;
while(x+step<n){
result[x][y] = k;
x++;
k++;
}
x--;
y--;
while(y>=step){
result[x][y] = k;
y--;
k++;
}
y++;
x--;
step++; //Most Important!!!!!!!!!!!!
while(x>=step){
result[x][y] = k;
x--;
k++;
}
x++;
y++;
}
return result;
}
}