更新

crossoverJie · crossoverJie · commit 1ad39074527d · 2018-01-04T13:54:41.000+08:00
diff --git a/src/main/java/com/crossoverjie/algorithm/LinkLoop.java b/src/main/java/com/crossoverjie/algorithm/LinkLoop.java
@@ -37,6 +37,7 @@ public boolean isLoop(Node node){
                 return true ;
             }
 
+            //一共只有两个节点，但却不是环形链表的情况，判断NPE
             if (fast.next == null){
                 return false ;
             }
diff --git a/src/test/java/com/crossoverjie/algorithm/TwoSumTest.java b/src/test/java/com/crossoverjie/algorithm/TwoSumTest.java
@@ -17,7 +17,7 @@ public void getTwo1() throws Exception {
     public void getTwo2(){
         TwoSum twoSum = new TwoSum() ;
         int[] nums ={1,3,5,7};
-        int[] two = twoSum.getTwo2(nums, 4);
+        int[] two = twoSum.getTwo2(nums, 10);
         System.out.println(JSON.toJSONString(two));
 
     }

Original file line number	Diff line number	Diff line change
`@@ -37,6 +37,7 @@ public boolean isLoop(Node node){`
`37`	`37`	`return true ;`
`38`	`38`	`}`
`39`	`39`
	`40`	`+ //一共只有两个节点，但却不是环形链表的情况，判断NPE`
`40`	`41`	`if (fast.next == null){`
`41`	`42`	`return false ;`
`42`	`43`	`}`
Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@ public void getTwo1() throws Exception {`
`17`	`17`	`public void getTwo2(){`
`18`	`18`	`TwoSum twoSum = new TwoSum() ;`
`19`	`19`	`int[] nums ={1,3,5,7};`
`20`		`- int[] two = twoSum.getTwo2(nums, 4);`
	`20`	`+ int[] two = twoSum.getTwo2(nums, 10);`
`21`	`21`	`System.out.println(JSON.toJSONString(two));`
`22`	`22`
`23`	`23`	`}`