54. 螺旋矩阵

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

示例 1:

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

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

解答：当时的第一想法就是转圈圈，设置上(up)、下(down)、左(left)、右(right)四个变量。每转一圈上(up)、左(left)均加1，下(down)、右(right) 减1。直到上(up)大于下(down)且左(left)大于右(right)，说明已经遍历完全。

class Solution:
    def spiralOrder(self, matrix):
        if not matrix:
            return []
        
        n = len(matrix)
        m = len(matrix[0])
        res = []
        up, down, left, right = 0, n-1, 0, m-1
        while up <= down and left <= right:
            for i in range(left, right+1):
                res.append(matrix[up][i])
            for j in range(up+1,down+1):
                res.append(matrix[j][right])
            if up < down and left < right:
                for s in range(right-1,left,-1):
                    res.append(matrix[down][s])
                for t in range(down,up,-1):
                    res.append(matrix[t][left])
            up, down, left, right = up+1, down-1, left+1, right-1
        return res