findPeakElement.cpp

// Source: https://leetcode.com/problems/find-peak-element/
// Author: Miao Zhang
// Date:   2021-01-23

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