itcompare
diff --git a/‎README.md‎
Lines changed: 101 additions & 85 deletions b/‎README.md‎
Lines changed: 101 additions & 85 deletions
diff --git a/‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/Parklot.java‎
Lines changed: 0 additions & 157 deletions b/‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/Parklot.java‎
Lines changed: 0 additions & 157 deletions
diff --git a/‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/Test2.java‎
Lines changed: 0 additions & 123 deletions b/‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/Test2.java‎
Lines changed: 0 additions & 123 deletions
diff --git a/‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/array/bsearch/二分查找.java‎
Lines changed: 18 additions & 14 deletions b/‎codes/algorithm/src/main/java/io/github/dunwu/algorithm/array/bsearch/二分查找.java‎
Lines changed: 18 additions & 14 deletions
@@ -11,24 +11,28 @@
 public class 二分查找 {
 
     public static void main(String[] args) {
-        Assertions.assertEquals(4, search(new int[] { -1, 0, 3, 5, 9, 12 }, 9));
-        Assertions.assertEquals(-1, search(new int[] { -1, 0, 3, 5, 9, 12 }, 2));
+        Solution s = new Solution();
+        Assertions.assertEquals(4, s.search(new int[] { -1, 0, 3, 5, 9, 12 }, 9));
+        Assertions.assertEquals(-1, s.search(new int[] { -1, 0, 3, 5, 9, 12 }, 2));
     }
 
-    public static int search(int[] nums, int target) {
-        if (nums == null || nums.length == 0) return -1;
-        int left = 0, right = nums.length - 1;
-        while (left <= right) {
-            int mid = left + (right - left) / 2;
-            if (nums[mid] == target) {
-                return mid;
-            } else if (nums[mid] < target) {
-                left = mid + 1;
-            } else if (nums[mid] > target) {
-                right = mid - 1;
+    static class Solution {
+
+        public int search(int[] nums, int target) {
+            int left = 0, right = nums.length - 1;
+            while (left <= right) {
+                int mid = left + (right - left) / 2;
+                if (nums[mid] == target) {
+                    return mid;
+                } else if (nums[mid] < target) {
+                    left = mid + 1;
+                } else {
+                    right = mid - 1;
+                }
             }
+            return -1;
         }
-        return -1;
+
     }
 
 }