题目
https://leetcode-cn.com/problems/find-peak-element/
二分查找
通过中间值nums[mid] 与nums[mid + 1]来缩小搜索区间
class Solution {
public int findPeakElement(int[] nums) {
int lo = 0, hi = nums.length - 1;
while (lo < hi) {
int mid = lo + (hi - lo) / 2;
if (nums[mid] > nums[mid + 1]) {
hi = mid;
} else {
lo = mid + 1;
}
}
return hi;
}
}