题解:
class Solution {
public:
int findPeakElement(vector<int>& nums) {
//相邻元素必不相同
int left = 0;
int right = nums.size()-1;
while(left<right){
int mid = (left+right)/2;
//大的那一边一定有峰值
if(nums[mid]>nums[mid+1]){
right = mid;
}else{
left = mid+1;
}
}
return left;
}
};