当前位置：网站首页>Leetcode162 - find peak - dichotomy - array

Leetcode162 - find peak - dichotomy - array

2022-04-23 14:48:00 【Li Fan, hurry up】

Original link
Insert picture description here

Note：

Two points , Every time we judge whether it is a peak , It's good which side the peak is on
However, we should unify the conditions and changes here , If we're going to look to the right , Let him compare with the previous one , So you don't cross the line

The code is as follows ：

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