[leetcode-59]spiral matrixII(java)

最新推荐文章于 2022-03-05 20:10:20 发布

zdavb

最新推荐文章于 2022-03-05 20:10:20 发布

阅读量545

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/zdavb/article/details/46834381

版权

leetcode 专栏收录该内容

243 篇文章 0 订阅

订阅专栏

问题描述：
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

For example,
Given n = 3,

You should return the following matrix:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]

与spiral matrix I 类似

代码如下：

public int[][] generateMatrix(int n) {
        int[][] result = new int[n][n];
        //init result
        for(int i = 0;i<n;i++)
            for(int j = 0;j<n;j++)
                result[i][j] = 0;

        int index = 0;
        int num = n*n;
        int row = 0,col = -1;
        while(index<num){
            for(col = col+1;col<n;col++){
                if(result[row][col]!=0)
                    break;
                result[row][col] = ++index;
            }
            col--;
            for(row = row+1;row<n;row++){
                if(result[row][col]!=0)
                    break;
                result[row][col] = ++index;
            }
            row--;
            for(col = col-1;col>=0;col--){
                if(result[row][col] != 0)
                    break;
                result[row][col] = ++index;
            }
            col++;
            for(row = row-1;row>=0;row--){
                if(result[row][col] != 0)
                    break;
                result[row][col] = ++index;
            }
            row++;
        }
        return result;
    }