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

Author: shimhun99

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

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