剑指 Offer 29. 顺时针打印矩阵(java+python)

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。

示例 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

java

class Solution {
    public int[] spiralOrder(int[][] matrix) {
        if (matrix.length==0)return new int[0];
        int l=0,r=matrix[0].length-1,u=0,d=matrix.length-1,x=0;
        int[] res= new int[(r+1)*(d+1)];
        while(true){
            for(int i=l;i<=r;i++)res[x++]=matrix[u][i];
            if(++u>d) break;
            for(int i=u;i<=d;i++)res[x++]=matrix[i][r];
            if(l>--r) break;
            for(int i=r;i>=l;i--)res[x++]=matrix[d][i];
            if(u>--d) break;
            for(int i=d;i>=u;i--)res[x++]=matrix[i][l];
            if(++l>r) break;
        }
        return res;
    }
}

python

class Solution(object):
    def spiralOrder(self, matrix):
        """
        :type matrix: List[List[int]]
        :rtype: List[int]
        """
        if not matrix: return []
        l, r, u, d, res = 0, len(matrix[0]) - 1, 0, len(matrix) - 1, []
        while True:
            for i in range(l, r + 1): res.append(matrix[u][i])
            u += 1
            if u > d: break
            for i in range(u, d + 1): res.append(matrix[i][r])
            r -= 1
            if l > r: break
            for i in range(r, l - 1, -1): res.append(matrix[d][i])
            d -= 1
            if u > d: break
            for i in range(d, u - 1, -1): res.append(matrix[i][l])
            l += 1
            if l > r: break
        return res