Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
Example:
Input: 3
Output:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
class Solution {
public int[][] generateMatrix(int n) {
int[][] matrix = new int[n][n];
int num = 1;
int dir = 0;
int startRow = 0;
int endRow = n - 1;
int startCol = 0;
int endCol = n - 1;
while (startRow <= endRow && startCol <= endCol) {
switch (dir) {
case 0:
for (int i = startCol; i <= endCol; i++) {
matrix[startRow][i] = num;
num++;
}
startRow++;
dir = 1;
break;
case 1:
for (int i = startRow; i <= endRow; i++) {
matrix[i][endCol] = num;
num++;
}
endCol--;
dir = 2;
break;
case 2:
for (int i = endCol; i >= startCol; i--) {
matrix[endRow][i] = num;
num++;
}
endRow--;
dir = 3;
break;
case 3:
for (int i = endRow; i >= startRow; i--) {
matrix[i][startCol] = num;
num++;
}
startCol++;
dir = 0;
break;
}
}
return matrix;
}
}