54. 螺旋矩阵
给定一个包含 m x n 个元素的矩阵(m 行, n 列),请按照顺时针螺旋顺序,返回矩阵中的所有元素。
示例 1:
输入:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
输出: [1,2,3,6,9,8,7,4,5]
示例 2:
输入:
[
[1, 2, 3, 4],
[5, 6, 7, 8],
[9,10,11,12]
]
输出: [1,2,3,4,8,12,11,10,9,5,6,7]
解题
给定数组,按顺序遍历数组;
(1)从左往右遍历到头
(2)从上往下遍历到头
(3)从右往左遍历到头
(4)从下往上遍历到头
建立visited数组,标记已遍历的点;
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int m=matrix.size();
if(!m) return {};
int n=matrix[0].size();
visited.resize(m,vector<bool> (n,0));
int i=0,j=0;
while(!visited[i][j])
{
while(j<n&&!visited[i][j])
{
visited[i][j]=1;
res.push_back(matrix[i][j]);
j++;
}
j--;
i++;
while(i<m&&!visited[i][j])
{
visited[i][j]=1;
res.push_back(matrix[i][j]);
i++;
}
i--;
j--;
while(j>=0&&!visited[i][j])
{
visited[i][j]=1;
res.push_back(matrix[i][j]);
j--;
}
j++;
i--;
while(i>=0&&!visited[i][j])
{
visited[i][j]=1;
res.push_back(matrix[i][j]);
i--;
}
i++;
j++;
}
return res;
}
private:
vector<vector<bool>> visited;
vector<int> res;
};
59. 螺旋矩阵 II
- 螺旋矩阵 II
给定一个正整数 n,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。
示例:
输入: 3
输出:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
按顺时针遍历,填表
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
res.resize(n,vector<int> (n,0));
visited.resize(n,vector<bool> (n,0));
int t=1;
int i=0,j=0;
while(!visited[i][j])
{
while(j<n&&!visited[i][j]){
visited[i][j]=1;
res[i][j]=t++;
j++;
}
j--;
i++;
while(i<n&&!visited[i][j]){
visited[i][j]=1;
res[i][j]=t++;
i++;
}
i--;
j--;
while(j>=0&&!visited[i][j]){
visited[i][j]=1;
res[i][j]=t++;
j--;
}
j++;
i--;
while(i>=0&&!visited[i][j]){
visited[i][j]=1;
res[i][j]=t++;
i--;
}
i++;
j++;
}
return res;
}
private:
vector<vector<int>> res;
vector<vector<bool>> visited;
};