Binary Search
Easy
Binary Search
Array
Divide and Conquer
Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.
Examples:
Input:
[[-1,0,3,5,9,12],9]Output:
4Explanation: 9 exists in nums and its index is 4
Input:
[[-1,0,3,5,9,12],2]Output:
-1Explanation: 2 does not exist in nums so return -1
Constraints:
- 1 ≤ nums.length ≤ 10⁴
- -10⁴ < nums[i], target < 10⁴
- All the integers in nums are unique.
- nums is sorted in ascending order.
Code Editor
Loading advanced editor...
Console Output
Ready to execute
Click "Run Code" to see your output here