模拟法---螺旋矩阵

模拟法

54.螺旋矩阵

class Solution {
    public List<Integer> spiralOrder(int[][] matrix) {
        List<Integer> res = new LinkedList<>();
        int t = 0, b = matrix.length - 1, l = 0, r = matrix[0].length - 1;
        while(l<=r&&t<=b){
            for(int j = l; j <= r;j++){
                res.add(matrix[t][j]);
            }
            if(++t > b) break;

            for(int i=t;i<=b;i++){
                res.add(matrix[i][r]);
            }
            if(--r < l) break;
            for(int j=r;j>=l;j--){
                res.add(matrix[b][j]);
            }
            if(--b < t) break;
            for(int i = b;i>=t;i--){
                res.add(matrix[i][l]);
            }
            if(++l > r) break;
        }
        return res;
    }
}

59螺旋矩阵Ⅱ

class Solution {
    public int[][] generateMatrix(int n) {
        int l = 0, r = n - 1, t = 0, b = n - 1;
        int[][] mat = new int[n][n];
        int num = 1, tar = n * n;
        while(num <= tar){
            for(int i = l; i <= r; i++) mat[t][i] = num++; // left to right.
            t++;
            for(int i = t; i <= b; i++) mat[i][r] = num++; // top to bottom.
            r--;
            for(int i = r; i >= l; i--) mat[b][i] = num++; // right to left.
            b--;
            for(int i = b; i >= t; i--) mat[i][l] = num++; // bottom to top.
            l++;
        }
        return mat;
    }
}