Binary Search
Easy
Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search for target in nums. If target exists, return its index; otherwise, return -1.
Examples:
Example 1:
Input:[-1, 0, 3, 5, 9, 12], 9
Output:4
Example 2:
Input:[-1, 0, 3, 5, 9, 12], 2
Output:-1
Constraints:
- 1 <= nums.length <= 10^4
- -10^4 < nums[i], target < 10^4
- All integers in nums are unique
- nums is sorted in ascending order
Limits:
Time limit: 1000 ms
Memory limit: 128 MB
Topics
Binary Search
Loading editor...
▶
Run your code to test against examples