-
Notifications
You must be signed in to change notification settings - Fork 35
/
SpiralMatrix.cpp
32 lines (32 loc) · 1008 Bytes
/
SpiralMatrix.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
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> ans;
int n = matrix.size();
int m = matrix[0].size();
int top = 0, left = 0, bottom = n-1, right = m-1;
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;
}
};