leetcode继续过题--螺旋矩阵--java

螺旋矩阵

给定一个包含 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 {
    public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> result = new ArrayList<>();
        //判空
        if(matrix.length==0||matrix[0].length==0){ return result;}
        int top = 0;
        int bottom =matrix.length-1;
        int left =0;
        int right = matrix[0].length-1;
        while(top<=bottom&&left<=right){
            int temp = left;
            while(temp<=right&&top<=bottom&&left<=right){
                result.add(matrix[top][temp]);
                temp++;
            }

            temp = ++top;
            while(temp<=bottom&&top<=bottom&&left<=right){
                result.add(matrix[temp][right]);
                temp++;
            }
            
            right--;
            temp = right;
            while(temp>=left&&top<=bottom&&left<=right){
                result.add(matrix[bottom][temp]);
                temp--;
            }
            bottom--;
            temp=bottom;
            while(temp>=top&&top<=bottom&&left<=right){
                result.add(matrix[temp][left]);
                temp--;
            }
            left++;
        }
        return result;
    }
}