59. Spiral Matrix II

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 ]
]
输出n阶旋转矩阵。程序如下所示:

class Solution {
    public int[][] generateMatrix(int n) {
        int[][] matrix = new int[n][n];
        int rowMin = 0, rowMax = n, colMin = 0, colMax = n;
        int val = 1;
        while (rowMin < rowMax&&colMin < colMax){
            for (int i = colMin; i < colMax; ++ i){
                matrix[colMin][i] = val ++;
            }
            for (int i = rowMin + 1; colMax - colMin > 1&&i < rowMax; ++ i){
                matrix[i][colMax-1] = val ++;
            }
            for (int i = colMax - 2; rowMax - rowMin > 1&&i >= colMin; -- i){
                matrix[rowMax-1][i] = val ++;
            }
            for (int i = rowMax - 2; colMax - colMin > 1&&i > rowMin; -- i){
                matrix[i][colMin] = val ++;
            }
            rowMin ++;
            rowMax --;
            colMin ++;
            colMax --;
        }
        return matrix;
    }
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值