Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
Your algorithm’s runtime complexity must be in the order of O(log n).
Example 1:
Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4
以某一点pivot为中心旋转一个排好序的数组,在这个数组中搜索target并返回index
思路:
首先,O(logn)内搜索肯定是binary search.
binary search的条件是排序的数组。
本题中是把一个升序数组以pivot为中心旋转,旋转之后整体不再是排好序的数组。
但是,left ~ mid或者mid ~right这两部分必有一部分是升序的。
只需考虑升序的部分即可。
判断target在不在升序部分的范围内,在的话就按binary search更新新的left, right.
不在的话, 说明target在另外半段,同样更新left, right。
另外,因为本身是升序数组,以pivot为中心旋转,所以pivot右边部分的所有值都会 < pivot左边的值,
不用担心出现nums[left] < nums[mid]时,mid在左半段还是右半段的问题。
public int search(int[] nums, int target) {
int n = nums.length;
int left = 0;
int right = n-1;
while(left <= right) {
int mid = left + (right-left) / 2;
if(nums[mid] == target) return mid;
if(nums[left] <= nums[mid]) { //左半边是排序的
if(target >= nums[left] && target < nums[mid]) { //target在左半边
right = mid - 1;
} else {
left = mid + 1;
}
} else { //右半边是排序的
if(target > nums[mid] && target <= nums[right]) left = mid + 1;
else right = mid - 1;
}
}
return -1;
}