题解 | #寻找峰值(进阶)#

class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param nums int整型vector
     * @return int整型
     */
    int findPeakElement(vector<int>& nums) {
        int pright = nums.size() - 1;
        int pleft = 0;
        while (pleft < pright) {
            int mid = (pleft + pright) / 2;
            if (nums[mid] > nums[mid + 1]) pright = mid;
            else pleft = mid + 1;
        }
        return pright;
    }
};