Create BinarySearch.java

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

@@ -0,0 +1,21 @@
+package com.nbee.solution.practice;
+
+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;
+            }
+            else if (target < nums[mid]){
+                j = mid - 1;
+            }
+            else {
+                j = mid + 1;
+            }
+            return mid;
+        }
+        return -1;
+    }
+}