leetcode/q_054_spiral_matrix.cpp at master · sentry5588/leetcode · GitHub

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
class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        vector<int> result;
        int top = 0, left = 0, right = matrix[0].size() - 1, bottom = matrix.size() - 1;
        int N = (right + 1) * (bottom + 1);
        int i = 0, j = 0;
        while (result.size() < N) {
            for (int j = left; j <= right; ++j) {
                result.push_back(matrix[top][j]);
                // cout << result.back() << endl;
            }
            if (result.size() >= N) {
                break;
            }
            top++;
            // cout << top << "," << right << "," << bottom << "," << left << ", after moving to right" << endl;
            for (int i = top; i <= bottom; ++i) {
                result.push_back(matrix[i][right]);
                // cout << result.back() << endl;
            }
            if (result.size() >= N) {
                break;
            }
            right--;
            // cout << top << "," << right << "," << bottom << "," << left << ", after moving to bottom" << endl;
            for (int j = right; j >= left; --j) {
                result.push_back(matrix[bottom][j]);
                // cout << result.back() << endl;
            }
            if (result.size() >= N) {
                break;
            }
            bottom--;
            // cout << top << "," << right << "," << bottom << "," << left << ", after moving to left" << endl;
            for (int i = bottom; i >= top; --i) {
                result.push_back(matrix[i][left]);
                // cout << result.back() << endl;
            }
            left++;
            // cout << top << "," << right << "," << bottom << "," << left << ", after moving to top" << endl;
        }

        return result;
    }
};