二分查找
class Solution {
public:
int findPeakElement(vector<int>& nums) {
int l=0,r=nums.size()-1;
while(1){
int mid=(l+r)>>1;
if((mid==0 || nums[mid-1]<nums[mid]) && (mid==nums.size()-1 ||nums[mid+1]<nums[mid])) return mid;
if(nums[mid+1]>nums[mid]) l=mid+1;
else r=mid-1;
}
}
};