885. Spiral Matrix III

You start at the cell (rStart, cStart) of an rows x cols grid facing east. The northwest corner is at the first row and column in the grid, and the southeast corner is at the last row and column.

You will walk in a clockwise spiral shape to visit every position in this grid. Whenever you move outside the grid's boundary, we continue our walk outside the grid (but may return to the grid boundary later.). Eventually, we reach all rows * cols spaces of the grid.

Return an array of coordinates representing the positions of the grid in the order you visited them.

Example 1:

Input: rows = 1, cols = 4, rStart = 0, cStart = 0
Output: [[0,0],[0,1],[0,2],[0,3]]

Example 2:

Input: rows = 5, cols = 6, rStart = 1, cStart = 4
Output: [[1,4],[1,5],[2,5],[2,4],[2,3],[1,3],[0,3],[0,4],[0,5],[3,5],[3,4],[3,3],[3,2],[2,2],[1,2],[0,2],[4,5],[4,4],[4,3],[4,2],[4,1],[3,1],[2,1],[1,1],[0,1],[4,0],[3,0],[2,0],[1,0],[0,0]]

Constraints:

• 1 <= rows, cols <= 100
• 0 <= rStart < rows
• 0 <= cStart < cols

class Solution {
public:
    vector<vector<int>> spiralMatrixIII(int rows, int cols, int rStart, int cStart) {
        vector<vector<int>>res;
        int i=rStart,j=cStart,k=0,pos=0;
        vector<vector<int>>dir{{0,1},{1,0},{0,-1},{-1,0}};
        while(pos!=rows*cols){//还有没有填充的
            int x=dir[k&3][0],y=dir[k&3][1];
            for(int count=0;count<k/2+1;count++){
                if(i>=0 && j>=0 && i<rows && j<cols){
                    res.push_back({i,j});
                    pos++;
                }
                i+=x;
                j+=y;
            }
            k++;
        }
        return res;
    }
};

思路：

        1.res二维数组用来存最后的答案

        2.{i，j}是初始位置，dir是用来表示方向的二维数组，例如{0,1}表示x不变，y向右移动一个单位。k表示方向，pos用来表示现在res数组中已经有的元素个数。

注意：

        [k&3]表示按位与运算