LeetCode-面试题29、顺时针打印矩阵-简单
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
示例 1:
输入:matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出:[1,2,3,6,9,8,7,4,5]
示例 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]
限制:
- 0 <= matrix.length <= 100
- 0 <= matrix[i].length <= 100
注意:本题与主站 54 题相同:https://leetcode-cn.com/problems/spiral-matrix/
代码:
class Solution:
def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
ans = []
while matrix:
ans += matrix.pop(0)
l = len(matrix)
for i in range(l):
matrix[i] = matrix[i][::-1]
if l == 1:
ans += matrix[0]
break
matrix = list(zip(*matrix))
return ans
# class Solution:
# def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
# return list(matrix[0]) + self.spiralOrder(list(zip(*matrix[1:]))[::-1]) if matrix else []