LeetCode周赛97 889. Spiral Matrix III C++ [自己开发的博客网站，欢迎访问](www.weiboke.online) www.weiboke.online

自己开发的博客网站，欢迎访问 www.weiboke.online

889. Spiral Matrix III

On a 2 dimensional grid with R rows and C columns, we start at (r0, c0) facing east.

Here, the north-west corner of the grid is at the first row and column, and the south-east corner of the grid is at the last row and column.

Now, we walk in a clockwise spiral shape to visit every position in this grid.

Whenever we would move outside the boundary of the grid, we continue our walk outside the grid (but may return to the grid boundary later.)

Eventually, we reach all R * C spaces of the grid.

Return a list of coordinates representing the positions of the grid in the order they were visited.

Example 1:

Input: R = 1, C = 4, r0 = 0, c0 = 0
Output: [[0,0],[0,1],[0,2],[0,3]]

Example 2:

Input: R = 5, C = 6, r0 = 1, c0 = 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]]

Note:

1. 1 <= R <= 100
2. 1 <= C <= 100
3. 0 <= r0 < R
4. 0 <= c0 < C
   ##Approach
   1.周赛第二题，题目大意很明显就是从矩阵某处出发，顺时针涡旋，然后输出轨迹，刚看到这道题的时候有点头疼，因为感觉要判断好多边界，但突然想到曾经一个益智解答题，解答说不要被貌似囚禁的东西给囚禁了，这道题也是，当这样想的时候，这道题就变成了一道模拟题，我就模拟它走的路线，符合矩阵范围的路线我就记录下来。

Code

class Solution {
public:
	vector<vector<int>> spiralMatrixIII(int R, int C, int r0, int c0) {
		int cur = 1, size = R*C, len = 1, cnt = 0;
		vector<vector<int>> vis{ {r0,c0} };
		while (cur < size) {
			cnt = 0;
			while (cnt<len) {
				cnt++;
				c0++;
				if (r0 >= 0 && r0 < R&&c0 >= 0 && c0 < C) {
					vis.push_back(vector<int>{r0, c0});
					cur++;
				}
			}
			cnt = 0;
			while (cnt < len) {
				cnt++;
				r0++;
				if (r0 >= 0 && r0 < R&&c0 >= 0 && c0 < C) {
					vis.push_back(vector<int>{r0, c0});
					cur++;
				}
			}
			len++;
			cnt = 0;
			while (cnt < len) {
				cnt++;
				c0--;
				if (r0 >= 0 && r0 < R&&c0 >= 0 && c0 < C) {
					vis.push_back(vector<int>{r0, c0});
					cur++;
				}
			}
			cnt = 0;
			while (cnt < len) {
				cnt++;
				r0--;
				if (r0 >= 0 && r0 < R&&c0 >= 0 && c0 < C) {
					vis.push_back(vector<int>{r0, c0});
					cur++;
				}
			}
			len++;
		}
		return vis;
	}
};