1. /**
    2.  * @param {number[]} nums
    3.  * @return {number}
    4.  */
    5. var findPeakElement = function(nums) {
    6.   return binarySearchPeak(nums, 0, nums.length - 1)
    7. };
    9. const binarySearchPeak = (nums, left, right) => {
    10.   if(right == left) return left
    12.   if(left == right - 1) return nums[left] > nums[right] ? left : right
    14.   let center = left + parseInt((right - left) / 2)
    16.   if(nums[center - 1] < nums[center] && nums[center] > nums[center + 1]) {
    17.     return center
    18.   } else if(nums[center - 1] > nums[center] && nums[center] > nums[center + 1]) {
    19.     return binarySearchPeak(nums, left, center - 1)
    20.   } else {
    21.     return binarySearchPeak(nums, center + 1, right)
    22.   }
    23. }