Binary Search
EasyP1Coding
nums is sorted in ascending order and has distinct values. Return the index of target in nums, or -1 if it is not present. The algorithm must run in O(log n).
Example 1
- Input
- nums = [-1,0,3,5,9,12], target = 9
- Output
- 4
Example 2
- Input
- nums = [-1,0,3,5,9,12], target = 2
- Output
- -1
Example 3
- Input
- nums = [5], target = 5
- Output
- 0
Constraints
- 1 <= nums.length <= 10^5
- -10^9 <= nums[i], target <= 10^9
- All values in nums are distinct and sorted ascending.
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 8. ⌘Enter runs, ⌘⇧Enter submits.