class Solution {
public:
int findPeakElement(vector<int>& nums) {
int left = 0, right = nums.size()-1, mid=0;
while(left<right){
mid = (left+right)/2;
if(nums[mid]<nums[mid+1]) left=mid+1;
else right = mid;
}
return right;
}
};
leetcode162+Find Peak Element+二分
最新推荐文章于 2024-05-02 10:05:47 发布