BiruLyu
6/20/2017 - 9:03 AM

## 54. Spiral Matrix.cpp

``````public class Solution {
public List<Integer> spiralOrder(int[][] matrix) {
List<Integer> res = new ArrayList<Integer>();
if (matrix == null || matrix.length < 1 || matrix[0].length < 1) return res;
int row = matrix.length;
int col = matrix[0].length;
int up = 0, down = row - 1, left = 0, right = col - 1;
while (true) {
// traverse from left to right
for (int i = left; i <= right; i++) {
}
if (++up > down) break;
// traverse from up to down
for (int i = up; i <= down; i++) {
}
if (--right < left) break;
//traverse from right to left
for (int i = right; i >= left; i--) {
}
if(--down < up) break;
//traverse from down to up
for (int i = down; i >= up; i--) {
}
if (++left > right) break;
}
return res;
}
}``````
``````/*
When traversing the matrix in the spiral order, at any time we follow one out of the following four directions: RIGHT DOWN LEFT UP. Suppose we are working on a 5 x 3 matrix as such:

0 1 2 3 4 5
6 7 8 9 10
11 12 13 14 15

Imagine a cursor starts off at (0, -1), i.e. the position at '0', then we can achieve the spiral order by doing the following:

Go right 5 times
Go down 2 times
Go left 4 times
Go up 1 times.
Go right 3 times
Go down 0 times -> quit
Notice that the directions we choose always follow the order 'right->down->left->up', and for horizontal movements, the number of shifts follows:{5, 4, 3}, and vertical movements follows {2, 1, 0}.

Thus, we can make use of a direction matrix that records the offset for all directions, then an array of two elements that stores the number of shifts for horizontal and vertical movements, respectively. This way, we really just need one for loop instead of four.

Another good thing about this implementation is that: If later we decided to do spiral traversal on a different direction (e.g. Counterclockwise), then we only need to change the Direction matrix; the main loop does not need to be touched.
*/

vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<vector<int> > dirs{{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
vector<int> res;
int nr = matrix.size();     if (nr == 0) return res;
int nc = matrix[0].size();  if (nc == 0) return res;

vector<int> nSteps{nc, nr-1};

int iDir = 0;   // index of direction.
int ir = 0, ic = -1;    // initial position
while (nSteps[iDir%2]) {
for (int i = 0; i < nSteps[iDir%2]; ++i) {
ir += dirs[iDir][0]; ic += dirs[iDir][1];
res.push_back(matrix[ir][ic]);
}
nSteps[iDir%2]--;
iDir = (iDir + 1) % 4;
}
return res;
}``````