题目

给定一个包含 m x n 个元素的矩阵（m 行, n 列），请按照顺时针螺旋顺序，返回矩阵中的所有元素。
示例 1:

  1. 输入:
  2. [
  3.  [ 1, 2, 3 ],
  4.  [ 4, 5, 6 ],
  5.  [ 7, 8, 9 ]
  6. ]
  7. 输出: [1,2,3,6,9,8,7,4,5]

示例 2:

  1. 输入:
  2. [
  3.   [1, 2, 3, 4],
  4.   [5, 6, 7, 8],
  5.   [9,10,11,12]
  6. ]
  7. 输出: [1,2,3,4,8,12,11,10,9,5,6,7]

答案

  1. #
  2. # @lc app=leetcode.cn id=54 lang=python3
  3. #
  4. # [54] 螺旋矩阵
  5. #
  7. # @lc code=start
  8. from typing import List
  11. class Solution:
  12.     def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
  13.         res = []
  14.         while matrix:
  15.             # [[4,5,6],[7,8,9]] 弹出[1,2,3]
  16.             res += matrix.pop(0)
  17.             # [[4,5,6],[7,8,9]] ==> [(4, 7), (5, 8), (6, 9)]
  18.             zipping = zip(*matrix)
  19.             # [(4, 7), (5, 8), (6, 9)] ==> [[4, 7], [5, 8], [6, 9]]
  20.             mapping = map(list, zipping)
  21.             #[[4, 7], [5, 8], [6, 9]] ==> [[6, 9], [5, 8], [4, 7]]
  22.             matrix = list(mapping)[::-1]
  23.         return res
  26. Solution().spiralOrder([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
  27. # @lc code=end

Note

image.png