LeetCode Top Interview Questions 54. Spiral Matrix (Java版； Medium)

welcome to my blog

LeetCode Top Interview Questions 54. Spiral Matrix (Java版; 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]

class Solution {
    public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> list = new ArrayList<>();
        if(matrix.length==0 || matrix[0].length==0){
            return list;
        }
        int n = matrix.length, m = matrix[0].length;
        int top=0, down=n-1, left=0, right=m-1;
        while(top<=down && left<=right){
            //left to right
            for(int j=left; j<=right; j++){
                list.add(matrix[top][j]);
            }
            top++;
            //up to down
            for(int i=top; i<=down; i++){
                list.add(matrix[i][right]);
            }
            right--;
            //right to left
            if(top<=down){
                for(int j=right; j>=left; j--){
                    list.add(matrix[down][j]);
                }
            }
            down--;
            //down to top
            if(left<=right){
                for(int i=down; i>=top; i--){
                    list.add(matrix[i][left]);
                }
            }
            left++;
        }
        return list;
    }
}

第一次做; 核心:打印几圈; 打印起点; 区间开闭

/*
核心:打印几圈; 打印起点; 区间开闭
*/
import java.util.List;
import java.util.ArrayList;


class Solution {
    public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> res = new ArrayList<>();
        if(matrix==null || matrix.length==0 || matrix[0]==null || matrix[0].length==0)
            return res;
        int rows = matrix.length, cols = matrix[0].length;
        int circleNum = (Math.min(rows, cols)+1)/2;
        for(int i=0; i<circleNum; i++){
            //左上(i,i),        右上(i,cols-1-i)
            //左下(rows-1-i,i), 右下(rows-1-i, cols-1-i)
            //从左上到右上;左闭右闭
            for(int j=i; j<=cols-1-i; j++){
                res.add(matrix[i][j]);
            }
            //如果有高度
            if(rows-1-i > i){
                //从右上到右下; 上开下闭
                for(int r=i+1; r<=rows-1-i; r++){
                    res.add(matrix[r][cols-1-i]);
                }
                //如果有宽度
                if(cols-1-i>i){
                    //右下到左下; 右开左闭
                    for(int c=cols-2-i; c>=i; c--){
                        res.add(matrix[rows-1-i][c]);
                    }
                    //左下到左上; 下闭上闭
                    for(int r=rows-2-i; r>i; r--){
                        res.add(matrix[r][i]);
                    }
                }
            }
        }
        return res;
    }
}