给你一个 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
1 <= m, n <= 10
-100 <= matrix[i][j] <= 100
很经典的题目哈,
思路:主要是通过深度优先搜索,因为每一圈走的方法是一样的,
无非是走过的路程不再继续走,所以可以建立一个相同空间的isWalk数组判断是否走过,
循环一圈之后,重新进入函数递归,注意边界条件即可。
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<vector<bool>> isWalk(matrix.size(), vector<bool>(matrix[0].size(), false));
printMatrix(matrix, isWalk, 0, 0);
return val;
}
void printMatrix(vector<vector<int>>& matrix, vector<vector<bool>>& isWalk, int x, int y) {
while (y < matrix[x].size() && isWalk[x][y] != true) {
val.push_back(matrix[x][y]);
isWalk[x][y] = true;
y++;
}
x++;
y--;
while (x < matrix.size() && isWalk[x][y] != true) {
val.push_back(matrix[x][y]);
isWalk[x][y] = true;
x++;
}
x--;
y--;
while (y >= 0 && isWalk[x][y] != true) {
val.push_back(matrix[x][y]);
isWalk[x][y] = true;
y--;
}
y++;
x--;
while (x >= 0 && isWalk[x][y] != true) {
val.push_back(matrix[x][y]);
isWalk[x][y] = true;
x--;
}
x++;
y++;
if (isWalk[x][y]) {
return;
}
printMatrix(matrix, isWalk, x, y);
}
void printTest() {
for (int i = 0; i < val.size(); i++) {
cout << val[i] << ",";
}
cout << endl;
}
private:
vector<vector<bool>> m;
vector<int> val;
};
int main() {
vector<vector<int>>matrix = { {1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12} };
Solution* ps = new Solution();
vector<int> res = ps->spiralOrder(matrix);
ps->printTest();
return 0;
}