54\. 螺旋矩阵
# 54. 螺旋矩阵 (opens new window)
# Description
Difficulty: 中等
Related Topics: 数组 (opens new window), 矩阵 (opens new window), 模拟 (opens new window)
给你一个 m
行 n
列的矩阵 matrix
,请按照 顺时针螺旋顺序 ,返回矩阵中的所有元素。
示例 1:
输入:matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出:[1,2,3,6,9,8,7,4,5]
1
2
2
示例 2:
输入:matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出:[1,2,3,4,8,12,11,10,9,5,6,7]
1
2
2
提示:
m == matrix.length
n == matrix[i].length
1 <= m, n <= 10
-100 <= matrix[i][j] <= 100
# Solution
Language: JavaScript
/**
* @param {number[][]} matrix
* @return {number[]}
*/
var spiralOrder = function(matrix) {
let n = []
while (matrix.length) {
n = _.concat(n, matrix.shift())
matrix = _.reverse(_.zip(...matrix))
}
return n
};
1
2
3
4
5
6
7
8
9
10
11
12
2
3
4
5
6
7
8
9
10
11
12