给定一个正整数 n,生成一个包含 1 到 n^2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。
示例:
输入: 3
输出:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
代码:
final static int LEFT = 1;
final static int RIGHT = 2;
final static int UP = 3;
final static int DOWN = 4;
public static int[][] getRecycleArray(int n){
int[][] a = new int[n][n];
int m = 0;
while (m < (n+1)/2){//兼容奇数和偶数得情况
if(m==0){
a[m][m] = 1;
}else {
a[m][m] = a[m][m-1] +1;
}
/**
主要思路就是向右,向下,向左,向上,走完一遍之后,还需要走n-2圈才结束
**/
operateArray(a,m,m, RIGHT);
operateArray(a,m, n-m-1, DOWN);
operateArray(a,n-m-1, n-m-1, LEFT);
operateArray(a,n-m-1, m, UP);
m++;
}
return a;
}
private static void operateArray(int[][] a, int r, int c, int orientation){
int maxRow = a.length;
int maxColumn = a[0].length;
switch (orientation){
case LEFT://向左走,需要判断边界a[r][j-1] ==0
for (int j =c; j-1>=0 && a[r][j-1] ==0;j-- ){
a[r][j-1] = a[r][j] + 1;
}
break;
case RIGHT://向右走,需要判断边界a[r][j+1] ==0
for (int j =c; j+1 < maxColumn && a[r][j+1] == 0; j++ ){
a[r][j+1] = a[r][j] + 1;
}
break;
case UP://向上走,需要判断边界a[i-1][c] ==0
for (int i = r; i-1>=0&& a[i-1][c] ==0; i--){
a[i-1][c] = a[i][c] + 1;
}
break;
case DOWN://向下走,需要判断边界a[i+1][c] ==0
for (int i = r; i +1<maxRow && a[i+1][c]==0; i++){
a[i+1][c] = a[i][c] +1;
}
break;
default:
break;
}
}