Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
For example,Given the following matrix:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
You should return [1,2,3,6,9,8,7,4,5].

思路：

上下左右4個(gè)變量分別表示邊界，如果越界，結(jié)束循環(huán)。

vector<int> spiralOrder(vector<vector<int>>& matrix){if (matrix.empty())return{};int m = matrix.size(), n = matrix[0].size();vector<int> spiral(m*n);int up = 0, down = m - 1, left = 0, right = n - 1, k = 0;while (1){for (int col = left; col <= right; col++)spiral[k++] = matrix[up][col];if (++up > down)break;for (int row = up; row <= down; row++)spiral[k++] = matrix[row][right];if (--right < left)break;for (int col = right; col >= left; col--)spiral[k++] = matrix[down][col];if (--down < up)break;for (int row = down; row >= up; row--)spiral[k++] = matrix[row][left];if (++left > right)break; }return spiral;}

參考：

https://discuss.leetcode.com/topic/21090/0ms-clear-c-solution

轉(zhuǎn)載于:https://www.cnblogs.com/hellowooorld/p/6930538.html

總結(jié)

以上是生活随笔為你收集整理的[leetcode-54-Spiral Matrix]的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。