题目
题解:
模板一&二:
class Solution {
public int findPeakElement(int[] nums) {
nt l = 0, r = nums.length - 1;
while(l < r) {
int mid = l + r >> 1;
//考虑左边,整体往右移一位
if(nums[mid] > nums[mid + 1]) {
r = mid;
} else {
l = mid + 1;
}
}
return l;
int l = 0, r = nums.length - 1;
while(l < r) {
int mid = l + r + 1 >> 1;
//考虑右边,整体往左移一位
if(nums[mid - 1] < nums[mid]) {
l = mid;
} else {
r = mid - 1;
}
}
return l;
}
}
图片理解: