螺旋矩阵

给定一个包含 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]

class Solution:
    def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
        m = len(matrix)
        if m == 0:
            return []
        n = len(matrix[0])
        row = int(m / 2 + 1)
        rUp = 0
        rDown = m-1
        cLeft = 0
        cRight = n-1
        count = 0
        out = []
        
        while count < row:
            if cLeft > cRight or rUp > rDown:
                break

            if cLeft == cRight:
                i = rUp
                while i <= rDown:
                    out.append(matrix[i][cRight])
                    i = i + 1
                break

            if rUp == rDown:
                i = cLeft
                while i <= cRight:
                    out.append(matrix[rUp][i])
                    i = i + 1
                break


            i = cLeft
            while i <= cRight:
                out.append(matrix[rUp][i])
                i = i + 1
            i = rUp + 1
            while i <= rDown:
                out.append(matrix[i][cRight])
                i = i + 1
            i = cRight - 1
            while i >= cLeft:
                out.append(matrix[rDown][i])
                i = i - 1
            i = rDown - 1
            while i >= rUp + 1:
                out.append(matrix[i][cLeft])
                i = i - 1
            cLeft = cLeft + 1
            cRight = cRight - 1
            rUp = rUp + 1
            rDown = rDown - 1
            count = count + 1
        
        return out