LeetCode 54. Spiral Matrix

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

For example,
Given the following matrix:

[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]

You should return [1,2,3,6,9,8,7,4,5].

觉得自己做这些矩阵的题目太费劲了，各种边界情况分不清，比做任何题都费劲

public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> list = new ArrayList<Integer>();
        if (matrix.length == 0) {
            return list;
        }
        int row = matrix.length;
        int col = matrix[0].length;

        if (matrix.length == 0) {
            return list;
        }
        int time = Math.min(row,col) / 2 ;

        for (int i = 0; i < time ; i++) {
            //右
            for (int j = i; j < col - i - 1; j++) {
                list.add(matrix[i][j]);
            }
            //下
            for (int j = i; j < row - i - 1 ; j++) {
                list.add(matrix[j][col - i - 1]);
            }
            //左
            for (int j = col - i -1; j > i ; j--) {
                list.add(matrix[row - i -1][j]);
            }
            //上
            for (int j = row - i - 1; j > i; j--) {
                list.add(matrix[j][i]);
            }

        }

        if (Math.min(row,col) % 2!= 0 || time==0) {
            if (row < col) {
                for (int j = time; j < col - time; j++) {
                    list.add(matrix[time][j]);
                }
            } else {
                for (int i = time; i < row - time; i++) {
                    list.add(matrix[i][time]);
                }
            }
        }
        return list;
    }