-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathspiral-matrix-ii.cpp
72 lines (70 loc) · 2.04 KB
/
spiral-matrix-ii.cpp
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
class Solution {
public:
//根据Spiral Matrix 直接改过来的,基本什么都没有变化。
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> result(n,vector<int>(n,n));
int m=n;
if(n==0){
return result;
}
vector<vector<bool>> flag(m,vector<bool>(n,false));
int i=0,j=0;
int flag1=0,flag2=1;//横 纵
int count=1;
while(count<=m*n){
if(flag1==0 && flag2==1 && count<=m*n){
while(j<n && !flag[i][j] ){
result[i][j]=count;
cout<<count<<endl;
flag[i][j]=true;
j++;
count++;
}
flag1=1;
flag2=1;
j-=1;
i+=1;
}
if(flag1==1 && flag2==1 && count<=m*n){
while((i<m) && !flag[i][j]){
result[i][j]=count;
cout<<count<<endl;
flag[i][j]=true;
i++;
count++;
}
flag1=1;
flag2=0;
i-=1;
j-=1;
}
if(flag1==1 && flag2==0 && count<=m*n){
while(j>=0 && !flag[i][j]){
result[i][j]=count;
cout<<count<<endl;
flag[i][j]=true;
j--;
count++;
}
flag1=0;
flag2=0;
j+=1;
i-=1;
}
if(flag1==0 && flag2==0 && count<=m*n){
while(i>=0 && !flag[i][j]){
result[i][j]=count;
cout<<count<<endl;
flag[i][j]=true;
i--;
count++;
}
flag1=0;
flag2=1;
i+=1;
j+=1;
}
}
return result;
}
};