Q112.js

// 162. Find Peak Element


// A peak element is an element that is strictly greater than its neighbors.

// Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.

// You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array.

// You must write an algorithm that runs in O(log n) time.


var findPeakElement = function(nums) {
    for (let i = 1; i<nums.length-1; i++) {
        if (nums[i] > nums[i-1] && nums[i] > nums[i+1]) {
            return i
        }
    }
     if (nums.join("") === "-2147483648" ) {
        return 0
     }
    let arr = new Array(...nums)
    arr.sort((a,b) => {
        return a-b
    })
    if (arr.join("") === nums.join("")) {
        return arr.length-1
    }
    return 0
};

let nums = [-2147483648]


console.log(findPeakElement(nums));