We’re preparing your current view and syncing the latest data.
Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If target exists, then return its index, otherwise return -1. You must write an algorithm with O(log n) runtime complexity.
Input consists of an integer array nums sorted in ascending order and an integer target.
Output an integer representing the index of target in nums if present, otherwise -1.
1 <= nums.length <= 10^4 -10^4 <= nums[i], target <= 10^4 All elements in nums are unique.
Example 1
Input
nums = [-1,0,3,5,9,12], target = 9
Output
4
Explanation
The target 9 is found at index 4 in nums.
Example 2
Input
nums = [-1,0,3,5,9,12], target = 2
Output
-1
Explanation
The target 2 is not present in nums, so return -1.