162. Find Peak Element

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

Given an input array nums, where nums[i] ≠ nums[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 nums[-1] = nums[n] = -∞.

Example 1:

Input: nums = [1,2,3,1]
Output: 2
Explanation: 3 is a peak element and your function should return the index number 2.
Example 2:

Input: nums = [1,2,1,3,5,6,4]
Output: 1 or 5 
Explanation: Your function can return either index number 1 where the peak element is 2, 
             or index number 5 where the peak element is 6.
Note:

Your solution should be in logarithmic complexity.

细度题目，我们要明白一个关键的点，就是题目必定有解；因为不论哪一种情况，数组中必定有一个最大值且该最大值两边的元素不等于该最大值（如果该最大值在边界，则边界看做小于该最大值），所以题目给出数组必定有解。

自己一开始的解法比较简单易懂，但时间复杂度不满足Note。代码如下：

public int findPeakElement(int[] nums) {
        int n = nums.length;
        int[] value = new int[n];
        value[0]++;
        value[n-1]++;
        for(int i = 0; i < n; ++i) {
            if(i - 1 >= 0 && nums[i] > nums[i-1]) {
                value[i]++;
            }
            if(n - i < nums.length && nums[n-1-i] > nums[n-i]) {
                value[n-i-1]++;
            }
            if(value[i] == 2) {
                return i;
            }
            if(value[n-i-1] == 2) {
                return n - i - 1;
            }
        }
        return 0;
    }

题目要求要有O(logn)的时间复杂度，又是在数组中寻找一个元素，不难想到使用二分查找的方法。

对于任意0<i<n-1（n为数组长度），num[i-1]、num[i]、num[i+1]可分为以下4种情况：

1，num[i-1] < num[i] > num[i+1]。num[i]是峰值元素。

2，num[i-1] < num[i] < num[i+1]。峰值元素存在于num[i+1...n-1]里。

3，num[i-1] > num[i] > num[i+1]。峰值元素存在于num[0...i-1]里。

4，num[i-1] > num[i] < num[i+1]。峰值元素在num[0...i-1]和num[i+1...n-1]里都存在。

对于i = 0或者i = n-1考虑方法同上。

代码如下：

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