加注释说明

znn0301 · znn0301 · commit b39fca2e205e · 2020-10-10T15:08:07.000+08:00
diff --git a/src/main/java/com/chen/algorithm/study/test240/Solution.java b/src/main/java/com/chen/algorithm/study/test240/Solution.java
@@ -5,6 +5,7 @@
  *
  * @author :  chen weijie
  * @Date: 2019-12-22 14:26
+ * @Description: 搜索二维矩阵
  */
 public class Solution {
 
diff --git a/src/main/java/com/chen/algorithm/study/test48/Solution.java b/src/main/java/com/chen/algorithm/study/test48/Solution.java
@@ -6,6 +6,7 @@
 /**
  * @author :  chen weijie
  * @Date: 2019-11-12 00:04
+ * @Description: 顺时针旋转图像90°
  */
 public class Solution {
 
diff --git a/src/main/java/com/chen/algorithm/study/test7/Solution4.java b/src/main/java/com/chen/algorithm/study/test7/Solution4.java
@@ -3,7 +3,7 @@
 /**
  * @Auther: zhunn
  * @Date: 2020/9/16 18:20
- * @Description:
+ * @Description: 整数反转
  */
 public class Solution4 {
 
diff --git a/src/main/java/com/chen/algorithm/study/test704/Solution.java b/src/main/java/com/chen/algorithm/study/test704/Solution.java
@@ -3,7 +3,7 @@
 /**
  * @Auther: zhunn
  * @Date: 2020/10/9 15:31
- * @Description: 二分查找 https://blog.csdn.net/Lngxling/article/details/78217619
+ * @Description: 二分查找及其变种 https://blog.csdn.net/Lngxling/article/details/78217619
  */
 public class Solution {
 
@@ -18,7 +18,7 @@ public static int bsearch(int[] array, int target) {
 
         int left = 0;
         int right = array.length - 1;
-        //这里必须是 >=,切记遗漏 =
+        //这里必须是 >=,切记勿遗漏 =
         while (right >= left) {
             // 当start=Integer.MAX_VALUE时，给它加个1都会溢出。安全的写法是：mid = start + (end-start)/2,但是会造成死循环，弃用
             //int mid = min + (max - min) >> 1;
diff --git a/src/main/java/com/chen/algorithm/study/test88/Solution.java b/src/main/java/com/chen/algorithm/study/test88/Solution.java
@@ -27,11 +27,13 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {
 
     @Test
     public void testCase() {
+        //int[] m = {1, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0};
+        //int[] n = {0, 2, 5, 6, 8, 9, 25};
+        //merge(m, 4, n, n.length);
         int[] m = {1,2,3,0,0,0};
         int[] n = {2,5,6};
         merge(m, 3, n, n.length);
         System.out.println(Arrays.toString(m));
-
     }
 
 }
diff --git a/src/main/java/com/chen/algorithm/study/test9/Solution4.java b/src/main/java/com/chen/algorithm/study/test9/Solution4.java
@@ -3,7 +3,7 @@
 /**
  * @Auther: zhunn
  * @Date: 2020/9/16 18:22
- * @Description:
+ * @Description: 回文数
  */
 public class Solution4 {
 

Original file line number	Diff line number	Diff line change
`@@ -5,6 +5,7 @@`
`5`	`5`	`*`
`6`	`6`	`* @author : chen weijie`
`7`	`7`	`* @Date: 2019-12-22 14:26`
	`8`	`+ * @Description: 搜索二维矩阵`
`8`	`9`	`*/`
`9`	`10`	`public class Solution {`
`10`	`11`
Original file line number	Diff line number	Diff line change
`@@ -27,11 +27,13 @@ public void merge(int[] nums1, int m, int[] nums2, int n) {`
`27`	`27`
`28`	`28`	`@Test`
`29`	`29`	`public void testCase() {`
	`30`	`+ //int[] m = {1, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0};`
	`31`	`+ //int[] n = {0, 2, 5, 6, 8, 9, 25};`
	`32`	`+ //merge(m, 4, n, n.length);`
`30`	`33`	`int[] m = {1,2,3,0,0,0};`
`31`	`34`	`int[] n = {2,5,6};`
`32`	`35`	`merge(m, 3, n, n.length);`
`33`	`36`	`System.out.println(Arrays.toString(m));`
`34`		`-`
`35`	`37`	`}`
`36`	`38`
`37`	`39`	`}`