【leetcode刷题笔记】Spiral Matrix

[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]

 1 #include<iostream>
 2 #include<vector>
 3 using namespace std;
 4 class Solution {
 5 public:
 6     vector<int> spiralOrder(vector<vector<int> > &matrix) {
 7         vector<int> ans;
 8 
 9         if(matrix.size() == 0)
10             return ans;
11 
12         int Xs = 0,Xe = matrix[0].size()-1,Ys = 0,Ye = matrix.size()-1;
13         int total = (Xe+1) * (Ye+1);
14 
15         for(int i = 0;i <= total;){
16             for(int k = Xs;k <= Xe;k++)
17             {
18                 ans.push_back(matrix[Ys][k]);
19                 i++;
20             }
21             if(i >= total)
22                 break;
23             else
24                 Ys++;
25 
26             for(int k = Ys;k <= Ye;k++)
27             {
28                 ans.push_back(matrix[k][Xe]);
29                 i++;
30             }
31             if(i >= total)
32                 break;
33             else
34                 Xe--;
35 
36             for(int k = Xe;k >= Xs;k--)
37             {
38                 ans.push_back(matrix[Ye][k]);
39                 i++;
40             }
41             if(i >= total)
42                 break;
43             else
44                 Ye--;
45 
46             for(int k = Ye;k >= Ys;k--)
47             {
48                 ans.push_back(matrix[k][Xs]);
49                 i++;
50             }
51             if(i >= total)
52                 break;
53             else
54                 Xs++;
55         }
56         return ans;
57     }
58 };
59 int main(){
60     Solution s;
61     vector<vector<int> > m;
62     vector<int>temp(1,1);
63     m.push_back(temp);
64 
65     vector<int> ans(s.spiralOrder(m));
66     cout <<ans.size()<<endl;
67 }