From 6c0d4365c6ed1e9a47c5f31e14d59912648f4afa Mon Sep 17 00:00:00 2001
From: lizhendong128 <lizhendong128@126.com>
Date: Fri, 13 May 2022 17:26:03 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E6=94=B90059=E8=9E=BA=E6=97=8B?=
 =?UTF-8?q?=E7=9F=A9=E9=98=B5II=20Java=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

精简Java代码中不必要的变量，调整结构，减少代码量，使代码更加易读
---
 problems/0059.螺旋矩阵II.md | 44 +++++++++------------------------
 1 file changed, 12 insertions(+), 32 deletions(-)

diff --git a/problems/0059.螺旋矩阵II.md b/problems/0059.螺旋矩阵II.md
index 93735895..7afc1575 100644
--- a/problems/0059.螺旋矩阵II.md
+++ b/problems/0059.螺旋矩阵II.md
@@ -130,57 +130,37 @@ Java：
 ```Java
 class Solution {
     public int[][] generateMatrix(int n) {
+        int loop = 0;  // 控制循环次数
         int[][] res = new int[n][n];
+        int start = 0;  // 每次循环的开始点(start, start)
+        int count = 1;  // 定义填充数字
+        int i, j;
 
-        // 循环次数
-        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;
-
+        while (loop++ < n / 2) { // 判断边界后，loop从1开始
             // 模拟上侧从左到右
-            for (; j<startY + n -offset; ++j) {
-                res[startX][j] = count++;
+            for (j = start; j < n - loop; j++) {
+                res[start][j] = count++;
             }
 
             // 模拟右侧从上到下
-            for (; i<startX + n -offset; ++i) {
+            for (i = start; i < n - loop; i++) {
                 res[i][j] = count++;
             }
 
             // 模拟下侧从右到左
-            for (; j > startY; j--) {
+            for (; j >= loop; j--) {
                 res[i][j] = count++;
             }
 
             // 模拟左侧从下到上
-            for (; i > startX; i--) {
+            for (; i >= loop; i--) {
                 res[i][j] = count++;
             }
-
-            loop--;
-
-            startX += 1;
-            startY += 1;
-
-            offset += 2;
+            start++;
         }
 
         if (n % 2 == 1) {
-            res[mid][mid] = count;
+            res[start][start] = count;
         }
 
         return res;