修改0059螺旋矩阵II Java版本

精简Java代码中不必要的变量,调整结构,减少代码量,使代码更加易读
This commit is contained in:
lizhendong128
2022-05-13 17:26:03 +08:00
parent 05384d58d8
commit 6c0d4365c6

View File

@ -130,57 +130,37 @@ Java
```Java ```Java
class Solution { class Solution {
public int[][] generateMatrix(int n) { public int[][] generateMatrix(int n) {
int loop = 0; // 控制循环次数
int[][] res = new int[n][n]; int[][] res = new int[n][n];
int start = 0; // 每次循环的开始点(start, start)
int count = 1; // 定义填充数字
int i, j;
// 循环次数 while (loop++ < n / 2) { // 判断边界后loop从1开始
int loop = n / 2;
// 定义每次循环起始位置
int startX = 0;
int startY = 0;
// 定义偏移量
int offset = 1;
// 定义填充数字
int count = 1;
// 定义中间位置
int mid = n / 2;
while (loop > 0) {
int i = startX;
int j = startY;
// 模拟上侧从左到右 // 模拟上侧从左到右
for (; j<startY + n -offset; ++j) { for (j = start; j < n - loop; j++) {
res[startX][j] = count++; res[start][j] = count++;
} }
// 模拟右侧从上到下 // 模拟右侧从上到下
for (; i<startX + n -offset; ++i) { for (i = start; i < n - loop; i++) {
res[i][j] = count++; res[i][j] = count++;
} }
// 模拟下侧从右到左 // 模拟下侧从右到左
for (; j > startY; j--) { for (; j >= loop; j--) {
res[i][j] = count++; res[i][j] = count++;
} }
// 模拟左侧从下到上 // 模拟左侧从下到上
for (; i > startX; i--) { for (; i >= loop; i--) {
res[i][j] = count++; res[i][j] = count++;
} }
start++;
loop--;
startX += 1;
startY += 1;
offset += 2;
} }
if (n % 2 == 1) { if (n % 2 == 1) {
res[mid][mid] = count; res[start][start] = count;
} }
return res; return res;