You are given an array of integers nums sorted in ascending order and an integer target. Return the index of target in nums. If target does not exist, return -1.
You must write an algorithm that runs in O(logn) time.
Examples
Example 1
Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4
Example 2
Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums, so return -1
Constraints
1≤nums.length≤105
−109≤nums[i], target≤109
All the integers in nums are unique.
nums is sorted in ascending order.
Examples
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
Loading editor...
Click "Run" to test with sample cases or "Submit" to run all tests.