问题描述
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.
分析
已经排好序的序列就首先考虑二分查找,尽管序列可能被旋转,还是可以用二分查找来解决,只不过要加一些判断条件。
算法(C++)
int search(vector<int>& nums, int target) {
if(nums.size() == 0)
return -1;
int left = 0;
int right = nums.size()-1;
while(left <= right){
int mid = (left+right)/2;
if(target == nums[mid])
return mid;
if((nums[mid]>=nums[left] && (target>nums[mid] || (target<nums[left]))) || (nums[mid]<nums[left] && target>nums[mid] && target<=nums[right]))
left = mid + 1;
else
right = mid -1;
}
return -1;
}