Time: 0 ms (100%), Space: 46 MB (22.77%) - LeetHub

Author: SHIMHUN

LeetCode/Easy/0704-binary-search/0704-binary-search.java

@@ -0,0 +1,19 @@
+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){
+                left = mid+1;
+            }else if(nums[mid] > target){
+                right = mid-1;
+            }else{
+                return mid;
+            }
+        }
+        
+        return -1;
+    }
+}