Given an integer array nums sorted in ascending order with distinct values, which is possibly rotated at an unknown pivot index, and an integer target, return the index of target if it is in nums, or -1 if it is not.
You must write an algorithm with O(log n) runtime complexity.
Example 1:
Input: nums = [4, 5, 6, 7, 0, 1, 2], target = 0
Output: 4
Explanation: 0 is found at index 4.
Example 2:
Input: nums = [4, 5, 6, 7, 0, 1, 2], target = 3
Output: -1
Explanation: 3 is not in the array.
Example 3:
Input: nums = [1], target = 0
Output: -1
1 <= nums.length <= 5000-10^4 <= nums[i] <= 10^4nums are uniquenums is an ascending array that is possibly rotated