find-peak-element.js

/**
 * Source:  https://leetcode.com/problems/find-peak-element/
 * Tags:    [Array,Binary Search]
 * Level:   Medium
 * Title:   Find Peak Element
 * Auther:  @imcoddy
 * Content: A peak element is an element that is greater than its neighbors.
 *
 * Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.
 *
 * The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
 *
 * You may imagine that num[-1] = num[n] = -∞.
 *
 * For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number 2.
 *
 * click to show spoilers.
 *
 * Note:
 * Your solution should be in logarithmic complexity.
 *
 *
 * Credits:Special thanks to @ts for adding this problem and creating all test cases.
 *
 *
 *                   Subscribe to see which companies asked this question
 */

/**
 * @param {number[]} nums
 * @return {number}
 */
var findPeakElement = function(nums) {

};