Time: 0 ms (100%), Space: 42 MB (67.9%) - LeetHub

Author: SHIMHUN

LeetCode/Medium/0033-search-in-rotated-sorted-array/0033-search-in-rotated-sorted-array.java

@@ -9,7 +9,7 @@ public int search(int[] nums, int target) {
             if(nums[mid] == target) return mid;
 
             if(nums[left] <= nums[mid]){
-                if(nums[left] <= target && target <= nums[mid]){
+                if(nums[left] <= target && target < nums[mid]){
                     right = mid-1;
                 }else{
                     left = mid+1;