criskgl
11/6/2019 - 5:22 PM

findPeak

public int findPeakElement(int[] nums) {
    return search(nums, 0, nums.length - 1);
}
public int search(int[] nums, int l, int r) {
    if (l == r)
        return l;
    int mid = (l + r) / 2;
    if (nums[mid] > nums[mid + 1])
        return search(nums, l, mid);
    return search(nums, mid + 1, r);
}