题意
题解
出现旋转排序,数列最左侧值一定大于最右侧的值;先二分求旋转排序后最小值的位置(单调性:小于等于右值),再分前后两个有序区间二分答案。
class Solution {
public:
int calc(vector<int>& nums, int target, int m){
// 对左侧有序区间二分
int lb = -1, ub = m - 1;
while(ub - lb > 1){
int mid = (lb + ub) >> 1;
if(nums[mid] >= target) ub = mid;
else lb = mid;
}
if(nums[ub] == target) return ub;
// 对右侧有序区间二分
lb = m - 1, ub = nums.size() - 1;
while(ub - lb > 1){
int mid = (lb + ub) >> 1;
if(nums[mid] >= target) ub = mid;
else lb = mid;
}
return nums[ub] == target ? ub : -1;
}
int search(vector<int>& nums, int target) {
if(nums.size() == 0) return -1;
// 数组未旋转,直接二分答案
if(nums[0] <= nums[nums.size() - 1]){
vector<int>::iterator ite = lower_bound(nums.begin(), nums.end(), target);
if(ite == nums.end()) return -1;
return *ite == target ? ite - nums.begin() : -1;
}
// 二分最小值
int lb = -1, ub = nums.size() - 1;
while(ub - lb > 1){
int mid = (lb + ub) >> 1;
if(nums[mid] < nums[ub]) ub = mid;
else lb = mid;
}
cout << ub << endl;
return calc(nums, target, ub);
}
};