| English | 简体中文 |
There is an integer array
nums sorted in ascending order (with distinct values).
Prior to being passed to your function,
nums is rotated at an unknown pivot index
0 <= k < nums.length) such that the resulting array is
[nums[k], nums[k+1], ..., nums[n-1], nums, nums, ..., nums[k-1]] (0-indexed). For example,
[0,1,2,4,5,6,7] might be rotated at pivot index
3 and become
Given the array
nums after the rotation and an integer
target, return the index of
target if it is in
-1 if it is not in
Input: nums = [4,5,6,7,0,1,2], target = 0 Output: 4
Input: nums = [4,5,6,7,0,1,2], target = 3 Output: -1
Input: nums = , target = 0 Output: -1
1 <= nums.length <= 5000
-104 <= nums[i] <= 104
- All values of
numsis guaranteed to be rotated at some pivot.
-104 <= target <= 104
Follow up: Can you achieve this in
O(log n)time complexity?