54. Spiral Matrix

54. Spiral Matrix (Medium)

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

Example 1:

Input:
[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]
Output: [1,2,3,6,9,8,7,4,5]

Example 2:

Input:
[
  [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]

Related Topics:
Array

Similar Questions:

• Spiral Matrix II (Medium)
• Spiral Matrix III (Medium)

Solution 1.

// OJ: https://leetcode.com/problems/spiral-matrix
// Author: github.com/lzl124631x
// Time: O(MN)
// Space: O(1)
class Solution {
public:
  vector<int> spiralOrder(vector<vector<int>>& matrix) {
    if (matrix.empty() || matrix[0].empty()) return {};
    vector<int> ans;
    int M = matrix.size(), N = matrix[0].size();
    for (int i = 0; ans.size() < M * N; ++i) {
      for (int j = i; j < N - i; ++j) ans.push_back(matrix[i][j]);
      for (int j = i + 1; j < M - i; ++j) ans.push_back(matrix[j][N - i - 1]);
      for (int j = N - i - 2; M - i - 1 != i && j >= i; --j) ans.push_back(matrix[M - i - 1][j]);
      for (int j = M - i - 2; N - i - 1 != i && j > i; --j) ans.push_back(matrix[j][i]);
    }
    return ans;
  }
};

Solution 2.

// OJ: https://leetcode.com/problems/spiral-matrix
// Author: github.com/lzl124631x
// Time: O(MN)
// Space: O(1)
class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        if (matrix.empty() || matrix[0].empty()) return {};
        vector<int> ans;
        int M = matrix.size(), N = matrix[0].size(), xl = 0, xh = M - 1, yl = 0, yh = N - 1;
        while (xl <= xh && yl <= yh) {
            int x = xl, y = yl;
            if (xl == xh) {
                while (y <= yh) ans.push_back(matrix[x][y++]);
                break;
            } else if (yl == yh) {
                while (x <= xh) ans.push_back(matrix[x++][y]);
                break;
            } else {
                while (y < yh) ans.push_back(matrix[x][y++]);
                --yh;
                while (x < xh) ans.push_back(matrix[x++][y]);
                --xh;
                while (y > yl) ans.push_back(matrix[x][y--]);
                ++yl;
                while (x > xl) ans.push_back(matrix[x--][y]);
                ++xl;
            }
        }
        return ans;
    }
};

Solution 3.

// OJ: https://leetcode.com/problems/spiral-matrix
// Author: github.com/lzl124631x
// Time: O(MN)
// Space: O(1)
class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& A) {
        if (A.empty() || A[0].empty()) return {};
        vector<int> ans;
        int M = A.size(), N = A[0].size(), i = 0, j = 0, lv = 0;
        for (; ans.size() < M * N; ++lv) {
            for (int k = lv; k < N - lv; ++k) ans.push_back(A[i][j++]);
            --j, ++i;
            for (int k = lv; k < M - 1 - lv; ++k) ans.push_back(A[i++][j]);
            --i, --j;
            if (ans.size() == M * N) break;
            for (int k = lv; k < N - 1 - lv; ++k) ans.push_back(A[i][j--]);
            ++j, --i;
            for (int k = lv; k < M - 2 - lv; ++k) ans.push_back(A[i--][j]);
            ++i, ++j;
        }
        return ans;
    }
};