Leetcode 852: Peak Index

问题描述：
Let’s call an array arr a mountain if the following properties hold:
arr.length >= 3
There exists some i with 0 < i < arr.length - 1 such that:
arr[0] < arr[1] < … arr[i-1] < arr[i]
arr[i] > arr[i+1] > … > arr[arr.length - 1]
Given an integer array arr that is guaranteed to be a mountain, return any i such that arr[0] < arr[1] < … arr[i - 1] < arr[i] > arr[i + 1] > … > arr[arr.length - 1].
一个数组先递增再递减，求峰值所在位置

线性搜索代码如下：

class Solution {
    public int peakIndexInMountainArray(int[] arr) {
        for(int i=1; i<arr.length-1; i++){
            if((arr[i]>arr[i-1])&&(arr[i]>arr[i+1])){
                return i;
            }
        }
        return -1;
    }
}

时间复杂度:O(n)

二叉搜索代码如下：

class Solution {
    public int peakIndexInMountainArray(int[] arr) {
        int left=0;
        int right=arr.length-1;
        while(left<right){
            int mid=left+(right-left)/2;
            //not the peak, find on the right side
            if(arr[mid+1]>arr[mid]){
                left=mid+1;
            }
            else if ((arr[mid]>arr[mid-1])&&(arr[mid]<arr[mid+1])){
                return mid;
            }
            else{
                right=mid;
            }
        }
        return left;
    }
}
}

时间复杂度:O(logn)