LeetCode算法——54. Spiral Matrixn (C++)
Given an m x n matrix, return all elements of the matrix in spiral order.
Example 1:
Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
Output: [1,2,3,6,9,8,7,4,5]
Example 2:
Input: matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
Output: [1,2,3,4,8,12,11,10,9,5,6,7]
Constraints:
m == matrix.length
n == matrix[i].length
1 <= m, n <= 10
-100 <= matrix[i][j] <= 100
解决思路:
每次走一个闭环圈,每个圈,四条边,四个for循环,起始点都是 i=j=level,圈数由m,n中较小的决定,m/n是偶数不需要额外处理,是奇数则加个额外处理;
代码:
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int level=0;
int m=matrix.size(),n=matrix[0].size(