给你一个 m 行 n 列的矩阵 matrix ,请按照 顺时针螺旋顺序 ,返回矩阵中的所有元素。
示例 1:
输入:matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出:[1,2,3,6,9,8,7,4,5]
示例 2:
输入:matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出:[1,2,3,4,8,12,11,10,9,5,6,7]
提示:
m == matrix.length
n == matrix[i].length
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int m = matrix.size();
int n = matrix[0].size();
int i = 0,j = 0;
int cnt = 1;
vector<int> result;
while(cnt<n*m){
while(j<n-1&&matrix[i][j+1] != 101){
result.push_back(matrix[i][j]);
matrix[i][j++] = 101;
cnt++;
}
while(i<m-1&&matrix[i+1][j] != 101){
result.push_back(matrix[i][j]);
matrix[i++][j] = 101;
cnt++;
}
while(j>0&&matrix[i][j-1] != 101){
result.push_back(matrix[i][j]);
matrix[i][j--] = 101;
cnt++;
}
while(i>0&&matrix[i-1][j] != 101){
result.push_back(matrix[i][j]);
matrix[i--][j] = 101;
cnt++;
}
}
if(result.size()<n*m){
result.push_back(matrix[i][j]);
}
return result;
}
};
1 <= m, n <= 10
-100 <= matrix[i][j] <= 100
通过次数198,906提交次数412,514
请问您在哪类招聘中遇到此题?
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/spiral-matrix
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题目分析
啊。。反正就是这样做嘛。