二分法处理

Author: zgpeace

code/LeetCode/src/Sqrt.java

@@ -39,11 +39,36 @@ public static int mySqrt(int x) {
         return (int)y;
     }
 
+    public static int mySqrtWithMid(int x) {
+        if(x < 1) {
+            return 0;
+        }
+        int left = 0;
+        int right = x;
+        while(true) {
+            int mid = left + ((right - left) >> 1);
+            if (mid < 1) {
+                return 1;
+            }
+            if (mid > x / mid) {
+                right = mid;
+            } else {
+                if (mid + 1 > x/(mid + 1)) {
+                    return mid;
+                }
+
+                left = mid + 1;
+            }
+        }
+    }
+
     public static void main(String[] args) {
         int input1 = 4;
         System.out.println("input: " +input1+ " sqrt: " + mySqrt(input1));
+        System.out.println("input: " +input1+ " mySqrtWithMid: " + mySqrtWithMid(input1));
 
         int input2 = 8;
         System.out.println("input: " +input2+ " sqrt: " + mySqrt(input2));
+        System.out.println("input: " +input2+ " mySqrtWithMid: " + mySqrtWithMid(input2));
     }
 }