Search in Rotated Sorted Array
MediumP1Coding
A sorted array of distinct integers was rotated at some unknown pivot (for example [0,1,2,4,5,6,7] became [4,5,6,7,0,1,2]). Given the rotated array nums and a target, return the index of target, or -1 if it is absent. Required: O(log n). A not-rotated array is also valid input.
Example 1
- Input
- nums = [4,5,6,7,0,1,2], target = 0
- Output
- 4
Example 2
- Input
- nums = [4,5,6,7,0,1,2], target = 3
- Output
- -1
Example 3
- Input
- nums = [1], target = 0
- Output
- -1
Constraints
- 1 <= nums.length <= 5000
- -10^4 <= nums[i], target <= 10^4
- All values are distinct.
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 9. ⌘Enter runs, ⌘⇧Enter submits.