59. Spiral Matrix II【数组】

最新推荐文章于 2025-01-09 18:09:55 发布

weixin_30843605

最新推荐文章于 2025-01-09 18:09:55 发布

阅读量63

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/flyfatty/p/6646435.html

本文提供了一种生成螺旋矩阵的方法，通过定义外围哨兵和使用switch-case结构来填充矩阵，实现了从1到n²的元素按螺旋顺序排列。

2017/3/30 14:28:32

Given an integer n, generate a square matrix filled with elements from 1 to n² in spiral order.

For example,
Given n = 3,

You should return the following matrix:

[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]

版本1：该题是螺旋矩阵问题的逆过程，对原问题稍作修改即可。

public class Solution {
    public int[][] generateMatrix(int n) {
        List<Integer> list = new ArrayList<Integer>();
		int count = 0;
		int[][] matrix = new int[n][n];
		if( n == 0 ) return matrix;
		int Gu_1 = n , Gu_2 = n , Gu_3 = -1;//外围哨兵
		int i = 0 , j = -1 , flag = 1;
		while( count < n*n ){
			switch( flag % 4 ){
				case 1: 
					if (j+1 == Gu_1 || matrix[i][j+1]!=0 )
						flag++;
					else{
						count++;
						matrix[i][++j] = count;
					}
					break;
				case 2: 
					if (i+1 == Gu_2 || matrix[i+1][j]!=0 )
						flag++;
					else{
						count++;
						matrix[++i][j] = count;
					}
					break;
				case 3:
					if (j-1 == Gu_3 || matrix[i][j-1]!=0)
						flag++;
					else{
						count++;
						matrix[i][--j] = count;
					}
					break;
				case 0: 
					if (matrix[i-1][j]!=0)
						flag++;
					else{
						count++;
						matrix[--i][j] = count;
					}
					break;
			}
		}
        return matrix;
    }
}

转载于:https://www.cnblogs.com/flyfatty/p/6646435.html