add leetcode

yi-yun · yi-yun · commit 0d0db5c845d6 · 2019-05-27T21:45:08.000+08:00
diff --git a/.idea/compiler.xml b/.idea/compiler.xml
diff --git a/README.md b/README.md
@@ -74,6 +74,10 @@
     - 深入理解 Mybatis
 
 # 记录
+
+## 5.27
+> I'm back.
+
 ## 5.9
 > 最近在搞大作业，佛性更新进度
 
diff --git a/java_test/src/main/java/com/yiyun/JustTest.java b/java_test/src/main/java/com/yiyun/JustTest.java
@@ -1,5 +1,7 @@
 package com.yiyun;
 
+import org.junit.Test;
+
 public class JustTest {
     {
         System.out.println("a.....");
@@ -18,4 +20,9 @@ public static void main(String[] args) {
         int i = Runtime.getRuntime().availableProcessors();
         System.out.println("i = " + i);
     }
+    @Test
+    public void fun(){
+        int i = ((6-3) >> 1 )+3;
+        System.out.println("i = " + i);
+    }
 }
diff --git a/myoffer/src/main/java/leetcode/LC_287.java b/myoffer/src/main/java/leetcode/LC_287.java
@@ -0,0 +1,60 @@
+package leetcode;
+
+import org.junit.Test;
+
+public class LC_287 {
+    public int findDuplicate(int[] nums) {
+        int fast=0,slow=0;
+        while (true){
+            fast=nums[nums[fast]];
+            slow=nums[slow];
+            if (fast==slow){
+                fast=0;
+                while (nums[fast]!=nums[slow]){
+                    fast=nums[fast];
+                    slow=nums[slow];
+                }
+                return nums[slow];
+            }
+        }
+    }
+    public int findDuplicate2(int[] nums) {
+        int start=1;
+        int end=nums.length-1;
+        while (start<=end){
+            int mid=((end-start)>>1)+start;
+            int cntRange = cntRange(nums, start, mid);
+            if (start==end){
+                if (cntRange>1){
+                    return start;
+                }else {
+                    break;
+                }
+            }
+            if (cntRange>mid-start+1){
+                end=mid;
+            }else {
+                start=mid+1;
+            }
+        }
+        return -1;
+    }
+    private int cntRange(int[] nums,int start,int end){
+        int cnt=0;
+        for (int i = 0; i < nums.length; i++) {
+            if (nums[i]>=start&&nums[i]<=end){
+                cnt++;
+            }
+        }
+        return cnt;
+    }
+    
+
+    @Test
+    public void fun(){
+        int[] ints = {3,1,4,3,2};
+//        int duplicate = findDuplicate(ints);
+        int duplicate = findDuplicate2(ints);
+        System.out.println("duplicate = " + duplicate);
+    }
+}

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,7 @@`
`1`	`1`	`package com.yiyun;`
`2`	`2`
	`3`	`+import org.junit.Test;`
	`4`	`+`
`3`	`5`	`public class JustTest {`
`4`	`6`	`{`
`5`	`7`	`System.out.println("a.....");`
`@@ -18,4 +20,9 @@ public static void main(String[] args) {`
`18`	`20`	`int i = Runtime.getRuntime().availableProcessors();`
`19`	`21`	`System.out.println("i = " + i);`
`20`	`22`	`}`
	`23`	`+ @Test`
	`24`	`+ public void fun(){`
	`25`	`+ int i = ((6-3) >> 1 )+3;`
	`26`	`+ System.out.println("i = " + i);`
	`27`	`+ }`
`21`	`28`	`}`