[leetcode]59. Spiral Matrix II(Java)

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

JacobGo

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

阅读量403

点赞数

分类专栏： leetcode 文章标签： Spiral Matrix II leetcode Java

本文链接：https://blog.csdn.net/zjkC050818/article/details/73773328

版权

leetcode 专栏收录该内容

130 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/spiral-matrix-ii/#/description

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 go.jacob.day627;

public class Demo2 {
	/*
	 * Runtime: 2 ms.Your runtime beats 66.13 % of java submissions.
	 */
	public int[][] generateMatrix(int n) {
		int[][] res = new int[n][n];
		if (n < 1)
			return res;
		int index = 1, rowStart = 0, rowEnd = n - 1, colStart = 0, colEnd = n - 1;
		while (index <= n * n) {
			for (int i = colStart; i <= colEnd; i++) {
				res[rowStart][i] = index++;
			}
			for (int i = rowStart + 1; i <= rowEnd; i++) {
				res[i][colEnd] = index++;
			}
			for (int i = colEnd - 1; i >= colStart; i--) {
				res[rowEnd][i] = index++;
			}
			for (int i = rowEnd - 1; i > rowStart; i--) {
				res[i][colStart] = index++;
			}

			rowStart += 1;
			rowEnd -= 1;
			colStart += 1;
			colEnd -= 1;

		}

		return res;
	}
}