题解 | #螺旋矩阵#

class Solution { public: vector spiralOrder(vector<vector > &matrix) { int x = matrix.size(); int y = matrix[0].size(); vector ans; if(x==0||y==0) return {}; int left = 0, right = y-1, up = 0, down = x-1; while(left<=right&&up<=down){ for(int i=left;i<=right;i++) ans.push_back(matrix[up][i]); //左右遍历 up++; if(left>right||up>down) break; // 左大于右或上大于下，跳出 for(int i=up;i<=down;i++) ans.push_back(matrix[i][right]); //上下遍历 right--; if(left>right||up>down) break; for(int i=right;i>=left;i--) ans.push_back(matrix[down][i]); down--; if(left>right||up>down) break; for(int i=down;i>=up;i--) ans.push_back(matrix[i][left]); left++; if(left>right||up>down) break; } return ans; } };