LeetCode力扣之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 ]
]
 
 
package leetCode;

import java.util.Arrays;

/**
 * Created by lxw, liwei4939@126.com on 2018/3/9.
 */
public class L059_Spiral_matrix {

    public int[][] generateMatrix(int n){

        if (n <= 0){
            return new int[0][0];
        }


        int[][] matrix = new int[n][n];

        int num = 1;
        int tR = 0, tC = 0;
        int dR = n -1, dC = n -1;

        while (tR <= dR && tC <= dC){

            for (int curC = tC; curC <= dC; curC++){
                matrix[tR][curC] = num++;
            }

            for (int curR = tR + 1; curR <= dR; curR++){
                matrix[curR][dC] = num++;
            }

            for (int curC = dC - 1; curC >= tC; curC --){
                matrix[dR][curC] = num ++;
            }

            for (int curR = dR -1; curR >= tR +1; curR --){
                matrix[curR][tC] = num ++;
            }

            tR ++;
            tC ++;
            dR --;
            dC --;
        }
        return matrix;
    }

    public static void main(String[] args){
        L059_Spiral_matrix tmp = new L059_Spiral_matrix();
        int[][] mat = tmp.generateMatrix(2);

       for (int i = 0; i < mat.length; i++){
           System.out.println(Arrays.toString(mat[i]));
       }
}

}


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值