162. Find Peak Element

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.

我的思路就是顺序遍历首先判断第一个元素是不是peak，如果是就直接返回。后面依次判断，遇到peak就return。直到倒数第二个元素，因为for循环中需要nums[i+1]所以此时跳出循环，此时判断是否最后一个元素大于倒数第二个，如果是就返回最后一个元素序号。

class Solution {
    public int findPeakElement(int[] nums) {
        if(nums.length==0||nums.length==1)
            return 0;
        if(nums[0]>nums[1])
            return 0;
        int left = nums[0];
        int i=1;
        for(;i<nums.length-1;i++){
            int right = nums[i+1];
            int cur = nums[i];
            if(cur>left&&cur>right)
                return i;
            else
                left = cur;       
        }
        int res = nums[i]>left?i:0;
        return res;
    }
}

但是这种方法的时间复杂度是O（N）,如果要提高效率答案中有用二分搜索：先从0和length-1作为头尾，取中间值，如果mid是peak就返回；如果nums[mid]<nums[mid+1]，left=mid+1即向右搜索；否则right=mid即向左搜索。

public int findPeakElement(int[] nums) {
    int N = nums.length;
    if (N == 1) {
        return 0;
    }
   
    int left = 0, right = N - 1;
    while (right - left > 1) {
        int mid = left + (right - left) / 2;
        if (nums[mid] < nums[mid + 1]) {
            left = mid + 1;
        } else {
            right = mid;
        }
    }
    
    return (left == N - 1 || nums[left] > nums[left + 1]) ? left : right;
}

r