Leetcode54. 螺旋矩阵 -hot100 -春招冲刺

题目：

---

代码(首刷看解析 2024年3月3日)：

        简单题,考研细节.top bottom left right是chatGPT给的灵感,用圈数太容易错了

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        int m = matrix.size();
        int n = matrix[0].size();
        vector<int> res;
        int top = 0, bottom = m - 1, left = 0, right = n - 1;
        // 左闭右开
        while (res.size() != m * n) {
            // 左右
            for (int j = left; j <= right; ++j) {
                res.emplace_back(matrix[top][j]);
            }
            ++top;

            // 上下
            for (int i = top; i <= bottom; ++i) {
                res.emplace_back(matrix[i][right]);
            }
            --right;

            // 右左
            if (top <= bottom) {
                for (int j = right; j >= left; --j) {
                    res.emplace_back(matrix[bottom][j]);
                }
            }
            --bottom;

            // 下上
            if (left <= right) {
                for (int i = bottom; i >= top; --i) {
                res.emplace_back(matrix[i][left]);
                }
            }
            ++left;
        }
        return res;
    }
};

---

代码（二刷自解 debug 看了解析 2024年3月27日）

        要注意这里的while()退出循环的条件，以及向左和向上遍历的时候注意条件判断；是<=，而且两个都要判断；

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        int m = matrix.size();
        int n = matrix[0].size();
        int top = 0, left = 0, bottom = m - 1, right = n - 1;
        vector<int> result;
        while (result.size() != m * n) 
        {
            for (int i = left; i <= right; ++i)
                result.emplace_back(matrix[top][i]);
            top++;

            for (int i = top; i <= bottom; ++i)
                result.emplace_back(matrix[i][right]);
            right--;
            // 这里的条件判断必须是<=，且后两个都需要条件判断
            if (top <= bottom) {
                for (int i = right; i >= left; --i)
                    result.emplace_back(matrix[bottom][i]);
                bottom--;
            }
            if (left <= right)
            {
                for (int i = bottom; i >= top; --i)
                    result.emplace_back(matrix[i][left]);
                left++;
            }
        }
        return result;
    }
};

---

代码（三刷debug看了解析 2024年8月5日）

注意下面两个if判断时，当从右往左遍历，需要判断的条件是是否在竖着的方向上top<=bottom，这是因为for循环里面已经做了横向上的判断

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        int left = 0, right = matrix[0].size() - 1;
        int top = 0, bottom = matrix.size() - 1;
        vector<int> res;
        while (res.size() < matrix.size() * matrix[0].size() ) {
            // 从left到right
            for (int i = left; i <= right; i++) {
                cout<<matrix[top][i]<<" ";
                res.emplace_back(matrix[top][i]);
            }
            cout<<endl;
            top++;

            for (int i = top; i <= bottom; i++) {
                cout<<matrix[i][right]<<" ";
                res.emplace_back(matrix[i][right]);
            }
            cout<<endl;
            right--;

            if (top <= bottom) {
                for (int i = right; i >= left; i--) {
                    cout<<matrix[bottom][i]<<" ";
                    res.emplace_back(matrix[bottom][i]);
                }
                cout<<endl;
            }
            bottom--;

            if (left <= right) {
                for (int i = bottom; i >= top; i--) {
                    cout<<matrix[i][left]<<" ";
                    res.emplace_back(matrix[i][left]);
                }
                cout<<endl;
            }
            left++;
        }
        return res;
    }
};