求出先增后减数组序列中的最大值

输入 {1,2,3,4,5，6，7,8,9 2，4,5,6} 

输出 9

要求时间复杂度小于O(n)

 

class Solution {
    public int findPeakElement(int[] nums) {
        return findPeakElement(nums,0,nums.length);
    }
    
    public int findPeakElement(int[] nums,int start,int end){
        int mid = (start+end)/2;
        int leftvalue = nums[mid-1];
        int midValue = nums[mid];
        int rightValue = nums[mid+1];
        //找到数据
        if(leftvalue < midValue && midValue>rightValue){
            return midValue;
        }else if(leftvalue>midValue){//去左半区域查找
            return findPeakElement(nums,start,mid-1);
        }else if(midValue<rightValue){//去右半区域查找
             return findPeakElement(nums,mid+1,end);
        }else{
               return -1;
        }
     
        
    }
}