1、二分法第一个模板(等号)
int findPeakElement(vector<int>& nums) {
int n = nums.size();
int l = 0, r = n - 1;
int mid;
while (l <= r) {
mid = l + (r - l) / 2;
if (mid + 1 < n && mid - 1 >= 0 && nums[mid - 1] < nums[mid] && nums[mid + 1] < nums[mid]) {
return mid;
}
else if ((mid - 1 >= 0 && nums[mid - 1] < nums[mid]) || mid - 1 < 0) {
l = mid + 1;
}
else {
r = mid - 1;
}
}
if (nums[0] > nums[n - 1])
return 0;
else
return n - 1;
}
2、二分法第二个模板(不等号)
找上坡的尽头
int findPeakElement(vector<int>& nums) {
int n = nums.size();
int l = 0, r = n - 1;
int mid;
while (l < r) {
mid = l + (r - l) / 2;
if (nums[mid] > nums[mid + 1])
r = mid;
else
l = mid + 1;
}
return l;
}
3、递归二分查找