LeetCode-54-螺旋矩阵

具体思路同LeetCode-剑指29-顺时针打印矩阵。

1、模拟

我们可以模拟螺旋遍历矩阵的形式，利用二维数组visited来标记有哪些格子已经被访问过了。当下一步的格子非法或已经访问过时，我们需要改变前进的方向。

class Solution {
public:
    vector<vector<int>> directions{{0,  1},
                                {1,  0},
                                {0,  -1},
                                {-1, 0}};

    vector<int> spiralOrder(vector<vector<int>> &matrix) {
        if (matrix.size() == 0) {
            return {};
        }

        int rows = matrix.size(), columns = matrix[0].size();
        vector<vector<bool>> visited(rows, vector<bool>(columns));
        int total = rows * columns;
        vector<int> order(total);

        int row = 0, column = 0;
        int directionIndex = 0;
        for (int i = 0; i < total; i++) {
            order[i] = matrix[row][column];
            visited[row][column] = true;
            int nextRow = row + directions[directionIndex][0], nextColumn = column + directions[directionIndex][1];
            if (nextRow < 0 || nextRow >= rows || nextColumn < 0 || nextColumn >= columns || visited[nextRow][nextColumn]) {
                directionIndex = (directionIndex + 1) % 4;
            }
            row += directions[directionIndex][0];
            column += directions[directionIndex][1];
        }
        return order;
    }
};

2、限定区域

我们可以限定当前可访问区域的四个角的坐标，而后依次将每条边上的值输出。值得注意的是，在此过程中我们需要确保左边界始终小于右边界，上边界始终小于下边界。

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        if (matrix.size() == 0 || matrix[0].size() == 0) {
            return {};
        }

        int rows = matrix.size(), columns = matrix[0].size();
        vector<int> order;
        int left = 0, right = columns - 1, top = 0, bottom = rows - 1;
        while (left <= right && top <= bottom) {
            for (int column = left; column <= right; column++) {
                order.push_back(matrix[top][column]);
            }
            for (int row = top + 1; row <= bottom; row++) {
                order.push_back(matrix[row][right]);
            }
            if (left < right && top < bottom) {
                for (int column = right - 1; column > left; column--) {
                    order.push_back(matrix[bottom][column]);
                }
                for (int row = bottom; row > top; row--) {
                    order.push_back(matrix[row][left]);
                }
            }
            left++;
            right--;
            top++;
            bottom--;
        }
        return order;
    }
};