class Solution {
public int findPeakElement(int[] nums) {
if (nums ==null || nums.length ==0) {
return 0;
}
int l =0;
int r =nums.length-1;
while(l<r) {
int mid =l +(r-l)/2;
// 分三种情况 1:单挑递增 2,单条递减 3,波浪线,其中肯定会有一个峰值
if (nums[mid] > nums[mid+1]) {
r =mid;
}
else{
l =mid+1;
}
}
return l;
}
}