There is an integer array nums sorted in ascending order (with distinct values).
Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]].
For example, [0,1,2,4,5,6,7] might be rotated to [4,5,6,7,0,1,2].
Given the rotated array nums 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.
nums = [4, 5, 6, 7, 0, 1, 2], target = 04nums = [4, 5, 6, 7, 0, 1, 2], target = 3-1nums = [1], target = 0-11 <= nums.length <= 5000-10^4 <= nums[i] <= 10^4All values in nums are uniquenums is a possibly rotated sorted array-10^4 <= target <= 10^4Expected time complexity: O(log n)Run your code to see results
Use Cmd+Enter to run