LeetCode-spiral-matrix-ii

六月二十七

于 2019-04-08 22:30:59 发布

阅读量208

点赞数

分类专栏： LeetCode 文章标签： spiral-matrix-ii LeetCode

本文链接：https://blog.csdn.net/weixin_42146769/article/details/89112814

版权

LeetCode 专栏收录该内容

105 篇文章 0 订阅

订阅专栏

Given an integer n, generate a square matrix filled with elements from 1 to n 2 in spiral order.

For example,
Given n =3,

You should return the following matrix:

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

public class Solution {
    public int[][] generateMatrix(int n) {
        int max = n*n;
        int num = 1;
        int rowb = 0,rowe = n-1;
        int colb = 0,cole = n-1;
        int [][]res = new int[n][n];
        while(rowb<=rowe&&colb<=cole){
            for(int i=rowb;i<=rowe;i++){
                res[rowb][i] = num;
                num++;
            }
            rowb++;
            for(int i=rowb;i<=rowe;i++){
                res[i][cole] = num;
                num++;
            }
            cole--;
            if(rowe>=rowb){
                for(int i = cole;i>=colb;i--){
                    res[rowe][i] = num;
                    num++;
                }
            }
            rowe--;
            if(cole>=colb){
                for(int i=rowe;i>=rowb;i--){
                    res[i][colb] = num;
                    num++;
                }
            }
            colb++;
        }
        return res;
    }
}