Java for LeetCode 059 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 ]
]

 

解题思路:

参考Java for LeetCode 054 Spiral Matrix,修改下代码即可,JAVA实现如下:

static public int[][] generateMatrix(int n) {
        if(n==0)
            return new int[0][0];
    	int[][] matrix=new int[n][n];
    	int num=0,left = 0, right = matrix[0].length - 1, up = 0, down = matrix.length - 1;
        while (left <= right && up <= down) {
            for (int i = left; i <= right&&up<=down; i++)
                matrix[up][i]=++num;
            up++;
            for (int i = up; i <= down&&left<=right; i++)
                matrix[i][right]=++num;
            right--;
            for (int i = right; i >= left&&up<=down; i--)
                matrix[down][i]=++num;
            down--;
            for (int i = down; i >= up&&left<=right; i--)
                matrix[i][left]=++num;
            left++;
        }
    	return matrix;  
    }

 

转载于:https://www.cnblogs.com/tonyluis/p/4506737.html

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值