leetcode - Spiral Matrix

分情况模拟
Time: $O(n)$
Space: $O(n)$

from functools import reduce
class Solution:
    def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
        def helper(left,right,top,down):
            output=[]
            if left==right:
                output=[matrix[i][left] for i in range(top,down+1)]
            elif top==down:
                output=matrix[top][left:right+1]
            else:
                output.extend(matrix[top][left:right]) #right stroke
                output.extend([matrix[i][right] for i in range(top,down)]) #down stroke
                output.extend(matrix[down][left+1:right+1][::-1]) #left stroke
                output.extend([matrix[i][left] for i in range(top+1,down+1)][::-1]) #up stroke
            return output
            
        tally=[]
        left,right,top,down=0,len(matrix[0])-1,0,len(matrix)-1
        while left<=right and top<=down: #not sure
            tally.append(helper(left,right,top,down))
            left,right,top,down=left+1,right-1,top+1,down-1
        return reduce(lambda a,b:a+b,tally)

神仙解法（StefanPochmann）
1.[*matrix.pop(0)]去掉第一行
2.[*zip(*matrix)][::-1]逆时针旋转矩阵（转置+逆向行）
3.然后对旋转后的矩阵递归

def spiralOrder(self, matrix):
    return matrix and [*matrix.pop(0)] + self.spiralOrder([*zip(*matrix)][::-1])