Update BinarySearch.java

src/main/java/com/nbee/solution/practice/BinarySearch.java

@@ -4,17 +4,16 @@ class BinarySearch {
     public static int binarySearchBasic(int[] nums, int target){
         int i = 0 ,j = nums.length - 1;//设置指针和初始值
         while (i <= j){
-            int mid = ((i + j) / 2);
-            if (target == nums[mid]){
-                return mid;
+            int m = ((i + j) / 2);
+            if (target < nums[m]){
+               j = m - 1;
             }
-            else if (target < nums[mid]){
-                j = mid - 1;
+            else if (nums[m] < target){
+                i = m + 1;
             }
             else {
-                j = mid + 1;
+                return m;
             }
-            return mid;
         }
         return -1;
     }