题目
代码(7.19 首刷看解析)
class Solution {
public:
int search(vector<int>& nums, int target) {
int n = nums.size() - 1;
int l = 0, r = n;
while(l <= r) {
int mid = (l+r)/2;
if(nums[mid] == target) return mid;
if(nums[mid] >= nums[0]) { // 顺序区间 0~mid有序
if(nums[0] <= target && target < nums[mid])
r = mid - 1;
else l = mid + 1;
} else {
if(nums[mid] < target && target <= nums[n])
l = mid + 1;
else r = mid - 1;
}
}
return -1;
}
};
代码(9.4 二刷看解析)
class Solution {
public:
int search(vector<int>& nums, int target) {
int n = nums.size()-1;
int l = 0, r = nums.size()-1;
while(l <= r) {
int mid = (l+r)/2;
if(nums[mid] == target)
return mid;
if(nums[mid] >= nums[0]) {
if(nums[0] <= target && target < nums[mid]) {
r = mid - 1;
} else {
l = mid + 1;
}
} else {
if(nums[mid] < target && target <= nums[n]) {
l = mid + 1;
} else {
r = mid - 1;
}
}
}
return -1;
}
};
代码(9.23 三刷自解)
先找到递增区间:通过nums[0]与nums[mid]判断是在l ~ mid 还是 mid ~ r
class Solution {
public:
int search(vector<int>& nums, int target) {
int l = 0, r = nums.size()-1;
while(l <= r) {
int mid = (l+r)/2;
if(nums[mid] == target)
return mid;
if(nums[0] <= nums[mid]) {
if(nums[0] <= target && target < nums[mid]) {
r = mid - 1;
} else {
l = mid + 1;
}
} else {
if(nums[mid] < target && target <= nums[r]) {
l = mid + 1;
} else {
r = mid - 1;
}
}
}
return -1;
}
};