peak-index-in-a-mountain-array.cpp

// Time:  O(logn)
// Space: O(1)

class Solution {
public:
    int peakIndexInMountainArray(vector<int>& A) {
        int left = 0, right = A.size();
        while (left < right) {
            const auto mid = left + (right - left) / 2;
            if (A[mid] > A[mid + 1]) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }
};