二分查找-162.寻找峰值-力扣(LeetCode)

int findPeakElement(vector<int>& nums)//解法1
    {
        int n = nums.size();
        for(int i = 0;i<n-1;i++)
        {
            if(nums[i]>nums[i+1]) return i;
        }
        return n-1;
    }

int findPeakElement(vector<int>& nums)//解法2
    {
        int left = 0,right = nums.size()-1;
        while(left<right)
        {
            long long mid = left + (right-left)/2;
            if(nums[mid]>nums[mid+1]) right = mid;
            else left = mid + 1;
        }
        return right;
    }