Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <vector>
- vector<int> Solution::spiralOrder(const vector<vector<int> > &A) {
- vector<int> soln;
- soln.push_back(A[0][0]);
- int i,j;
- int r = A.size() - 1;
- int c = A[0].size() - 1;
- for(i=0; i<c; i++){
- for(j=i+1; j<=(c-i); j++)
- soln.push_back(A[i][j]);
- for(j=i+1;j<=r-i;j++);
- soln.push_back(A[j][c-i]);
- for(j=(c-i-1);j>=i;j--)
- soln.push_back(A[r-i][j]);
- for(j=(r-i-1);j>=i;j--)
- soln.push_back(A[j][i]);
- }
- return soln;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement