-
Notifications
You must be signed in to change notification settings - Fork 0
/
spiralOrder.cpp
47 lines (35 loc) · 1.01 KB
/
spiralOrder.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
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int row = matrix.size();
int col = matrix[0].size();
int top = 0;
int left = 0;
int right = col - 1;
int bottom = row - 1;
vector<int> ans;
while(top <= bottom && left <= right){
for(int i= left; i<=right; i++){
ans.push_back(matrix[top][i]);
}
top++;
for(int i = top; i<=bottom; i++){
ans.push_back(matrix[i][right]);
}
right--;
if(top<=bottom){
for(int i = right; i>=left; i--){
ans.push_back(matrix[bottom][i]);
}
bottom--;
}
if(left<=right){
for(int i = bottom; i>=top; i--){
ans.push_back(matrix[i][left]);
}
left++;
}
}
return ans;
}
};