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.
给定一个数组，满足 num[i] ≠ num[i+1]，找出 peak元素并返回索引。
思路：
二分法。
二分时mid有如图4种情况。

分别对应不同的二分取值。

class Solution {
    public int findPeakElement(int[] nums) {
        if(nums == null || nums.length == 0) return  -1;
        int start = 0;
        int end = nums.length-1;
        while(start + 1 < end){
            int mid = start + (end - start)/2;
            if ( nums[mid] < nums[mid + 1] ) {
                start = mid;
            }else if( nums[mid] < nums[mid-1] ){
                end = mid;
            }else 
                end = mid;
            }
         //double check 
        if(nums[start]<nums[end]){
            return end;
        }else {
            return start;
        }
    }
}