nianhua120的专栏

转载请注明csdn的地址,谢谢。

LeetCode162. 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.

click to show spoilers.

Note:

Your solution should be in logarithmic complexity.

这道题要求在O (lgn)的复杂度下找peak值,肯定不能使用遍历,遍历是O(n)。那么可以使用二分法。因为数组两边是无穷小,那么数组里面一定存在peak值。只要我们划分空间即可。

    static  int findPeakElementImp(int[] array, int s , int e){
        if(e-s <= 1){
           return array[e]> array[s]?e:s;
        }
        int mid = s+ (e-s)/2;
        if(array[mid] > array[mid -1] && array[mid]> array[mid+1]){
            return  mid;
        }
        if( array[mid] > array[mid+1]){
            return findPeakElementImp(array ,s, mid);
        }else{
            return  findPeakElementImp(array, mid ,e);
        }
    }
    static  public  void main(String[] args ){
        int[] testArray ={1,2,6};
        int result = findPeakElementImp(testArray, 0, testArray.length -1 );
        System.out.println(result);
    }


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/nianhua120/article/details/51554106
文章标签: leetcode 二分法
个人分类: 算法
上一篇LeetCode199 打印树最右边的值
下一篇leetcode 198. House Robber
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭