137

Author: wind-liang

SUMMARY.md

@@ -102,7 +102,7 @@
 * [98. Validate Binary Search Tree](leetCode-98-Validate-Binary-Search-Tree.md)
 * [99. Recover Binary Search Tree](leetcode-99-Recover-Binary-Search-Tree.md)
 * [100. Same Tree](leetcode-100-Same-Tree.md)
-* [101 题到 136 题](leetcode-101-200.md)
+* [101 题到 137 题](leetcode-101-200.md)
     * [101. Symmetric Tree](leetcode-101-Symmetric-Tree.md)
     * [102. Binary Tree Level Order Traversal](leetcode-102-Binary-Tree-Level-Order-Traversal.md)
     * [103. Binary Tree Zigzag Level Order Traversal](leetcode-103-Binary-Tree-Zigzag-Level-Order-Traversal.md)
@@ -138,4 +138,5 @@
     * [133. Clone Graph](leetcode-133-Clone-Graph.md)
     * [134. Gas Station](leetcode-134-Gas-Station.md)
     * [135. Candy](leetcode-135-Candy.md)
-    * [136. Single Number](leetcode-136-Single-Number.md)
+    * [136. Single Number](leetcode-136-Single-Number.md)
+    * [137*. Single Number II](leetcode-137-Single-NumberII.md)

leetCode-54-Spiral-Matrix.md

@@ -34,9 +34,9 @@ public List<Integer> spiralOrder(int[][] matrix) {
 		//注意 y 方向写在前边，x 方向写在后边
         ans.add(matrix[start_y][start_x]);
         switch (direction) {
-            //当前向左
+            //当前向右
             case 0:
-                //继续向左是否到达边界
+                //继续向右是否到达边界
                 //到达边界就改变方向，并且更新上边界
                 if (start_x + 1 == right_border) {
                     direction = 1;

leetCode-59-Spiral-MatrixII.md

@@ -28,9 +28,9 @@ public int[][] generateMatrix(int n) {
         ans[start_y][start_x] = count;
         count++;
         switch (direction) {
-                // 当前向左
+                // 当前向右
             case 0:
-                // 继续向左是否到达边界
+                // 继续向右是否到达边界
                 // 到达边界就改变方向，并且更新上边界
                 if (start_x + 1 == right_border) {
                     direction = 1;

leetcode-101-200.md

@@ -68,4 +68,6 @@
 
 <a href="leetcode-135-Candy.html">135. Candy</a>
 
-<a href="leetcode-136-Single-Number.html">136. Single Number</a>
+<a href="leetcode-136-Single-Number.html">136. Single Number</a>
+
+<a href="leetcode-137-Single-NumberII.html">137. Single Number II</a>