点击打开链接
class Solution {
public:
int findPeakElement(vector<int>& nums) {
int left =0, right= nums.size()-1;
while (left<right) {
int mid=(left+right)/2;
if(nums[mid]<nums[mid+1]) left=mid+1; //说明右边大,往右边走
else right=mid;
}
return right;
}
};
![](https://i-blog.csdnimg.cn/blog_migrate/587ec3a0874435b73a849f5b9ecb4218.png)