class Solution {
public:
int findPeakElement(vector<int>& nums)
{
int low=0;
int high=nums.size()-1;
while(low<high)
{
int mid=low+(high-low)/2;
if(nums[mid]>nums[mid+1])
high=mid;
else
low=mid+1;
}
return low;
}
};
Find Peak Element
最新推荐文章于 2020-11-24 11:48:40 发布