题目:
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.
思路:
由于数组由有序数组旋转得到,故可考虑采用二分查找法来解决。但要注意的是,旋转过后,数组是局部有序的。故采用以下解题方法:
首先,判断临界点是否目标,若是则输出该坐标,查找结束。
否则,判断b<e-1,
若是,找到该数组的中点,查看是否是目标,若是则输出该中点坐标,查找结束。
若不是根据中点处数据与数组起始数据和结尾数据的大小来判断中点的左侧还是右侧有序(由有序数组旋转后的性质可知,必有一边有序)。
若左侧有序且目标数位于nums[b]与nums[middle]之间,则e=middle,否则b=middle。
若右边有序且目标数位于nums[middle]与nums[e]之间,则b=middle,否则e=middle。
否则,输出-1;
代码:
class Solution {
public:
int search(vector<int>& nums, int target) {
int length = nums.size();
int ret;
return BinarySearch(nums, 0, length - 1, target);
}
int BinarySearch(vector<int>& nums, int b, int e, int target)
{
if (target == nums[b])
return b;
if (target == nums[e])
return e;
while (b<e-1)
{
int middle = (b + e) / 2;
if (target == nums[middle])
return middle;
if (nums[b] <= nums[middle]) //中点左边有序
{
if (nums[b] <= target && target <= nums[middle])
{
e = middle;
}
else
b = middle;
}
else //中点右边有序
{
if (nums[middle] <= target && target <= nums[e])
b = middle;
else
e = middle;
}
}
return -1;
}
};