leetcode -- 54. Spiral Matrix

题目描述

题目难度：Medium
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

• Example 1:

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

• Example 2:

Input:
[
[1, 2, 3, 4],
[5, 6, 7, 8],
[9,10,11,12]
]
Output: [1,2,3,4,8,12,11,10,9,5,6,7]

AC代码1

class Solution {
    public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> resList = new ArrayList<>();
        if(matrix == null || matrix.length == 0) return resList;
        int n = matrix.length * matrix[0].length;
        int[] dr = new int[]{0, 1, 0, -1};
        int[] dc = new int[]{1, 0, -1, 0};
        boolean[][] seen = new boolean[matrix.length][matrix[0].length];
        int i = 0;
        int r = 0, c = 0, di = 0;
        while(i < n){
            seen[r][c] = true;
            resList.add(matrix[r][c]);
            int cr = r + dr[di];
            int cc = c + dc[di];
            if(cr >= 0 && cr < matrix.length && cc >= 0 && cc < matrix[0].length && seen[cr][cc] == false){
                r = cr;
                c = cc;
            }
            else{
                di = (di + 1) % 4;
                r += dr[di];
                c += dc[di];
            }
            i++;
        }
        return resList;
    }
}

AC代码2

class Solution {
    
    List<Integer> resList = new ArrayList<>();
    
    public List<Integer> spiralOrder(int[][] matrix) {
        if(matrix == null || matrix.length == 0) return resList;
        printMatrixCore(matrix, 0, matrix.length - 1, 0, matrix[0].length - 1);
        return resList;
    }
    
    private void printMatrixCore(int[][] matrix, int startRow, int endRow, int startCol, int endCol){
        int i = 0;
        if(startRow < endRow && startCol < endCol){
            for(i = startCol;i <= endCol;i++) resList.add(matrix[startRow][i]);
            for(i = startRow + 1;i <= endRow;i++) resList.add(matrix[i][endCol]);
            for(i = endCol - 1;i >= startCol;i--) resList.add(matrix[endRow][i]);
            for(i = endRow - 1;i > startRow;i--) resList.add(matrix[i][startCol]);
            printMatrixCore(matrix, startRow + 1, endRow - 1, startCol + 1, endCol - 1);
        }
        else if(startRow == endRow && startCol == endCol) resList.add(matrix[startRow][startCol]);
        else if(startRow == endRow && startCol < endCol){
            for(i = startCol;i <= endCol;i++) resList.add(matrix[startRow][i]);
        }
        else if(startRow < endRow && startCol == endCol){
            for(i = startRow;i <= endRow;i++) resList.add(matrix[i][startCol]);
        }
    }
}