题目描述:
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.
题目要求搜索一旋转数组中的某数。旋转数组为一有序数组分为两部分,并将后半部分接到前半部分之前。因为数组部分是有序的,只是中间存在一个断点。所以略微修改二分搜索,先判断某部分是否有序。如果有序,则判断目标是否在这一部分。如果无序,则另一部分一定有序,转化为前一种情况。最终能判断目标数的位置。
代码如下:
class Solution {
public:
int search(vector<int>& nums, int target) {
int min = 0, max = nums.size() - 1, mid = 0;
while(min <= max){
mid = (min + max) / 2;
if(nums[mid] == target){
return mid;
}
if(nums[min] <= nums[mid]){
if(nums[min] <= target && target < nums[mid]){
max = mid - 1;
} else {
min = mid + 1;
}
} else {
if(nums[mid] < target && target <= nums[max]){
min = mid + 1;
} else {
max = mid - 1;
}
}
}
return -1;
}
};