CODE 74: 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 ]
]
	public int[][] generateMatrix(int n) {
		// IMPORTANT: Please reset any member data you declared, as
		// the same Solution instance will be reused for each test case.
		int[][] matrix = new int[n][n];
		int number = 1;
		int halfCol = (n - 1) / 2;
		int halfRow = (n - 1) / 2;
		int col = 0;
		int row = 0;
		while (row <= halfRow && col <= halfCol) {
			for (int i = col; i < n - col; i++) {
				matrix[row][i] = number++;
			}
			for (int i = row + 1; i < n - row; i++) {
				matrix[i][n - col - 1] = number++;
			}
			if (row != n - row - 1) {
				for (int i = n - col - 2; i >= col; i--) {
					matrix[n - row - 1][i] = number++;
				}
			}

			if (col != n - col - 1) {
				for (int i = n - row - 2; i >= row + 1; i--) {
					matrix[i][col] = number++;
				}
			}
			row++;
			col++;
		}
		return matrix;
	}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值