Suppose a sorted array 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.
从题干中可以看出,这道题还是很类似于No.153和No.154,都是一个类型的,所以我们仍采用变形的二分查找法来解题。再强调一遍,对于局部有序,采用变形的二分查找法。关键就在于,我们要准确地确定二分查找的两个边界,保证目标值如果存在,就一定在我们的查找区间内。
数组中不存在重复值,这给我们减轻了难度。
class Solution {
public:
int search(vector<int>& nums, int target) {
//因为这还是一个局部有序的数组,用变形的二分查找
int iBegin = 0, iEnd = nums.size() - 1;
int iMid = 0;
while(iBegin <= iEnd)
{
iMid = (iBegin + iEnd) >> 1;
//若找到目标值,立即结束战斗
if(nums[iMid] == target)
return iMid;
//如果运行到这里,就一定有nums[iMid] != target
//若中间值大于结尾,表明中值点在第一段
if(nums[iMid] > nums[iEnd])
{
//若目标在区间[iBegin,iMid]上
if(nums[iMid] > target && nums[iBegin] <= target)
iEnd = iMid - 1;
else
iBegin = iMid + 1;
}
else //中值点在第二段
{
//若目标在区间[iMid,iEnd]上
if(nums[iMid] < target && nums[iEnd] >= target)
iBegin = iMid + 1;
else
iEnd = iMid - 1;
}
}
return -1;
}
};