【leetcode刷题笔记】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(logn)的时间复杂度找到局部最大值，很容易想到二分算法。设置一个函数 private boolean findPeakHelper(int[] num,int begin,int end){ ，每次判断(begin+end)/2位置上的元素是否满足要求，如果不满足就搜索左半边数组，如果在左半边搜索到了，右半边就没有必要搜索了，因为题目只让返回一个解；如果左半边没搜索到，就继续递归搜索右半边。特别注意对位置0和位置n-1处元素的处理。

JAVA版本代码如下：

 public class Solution {
     int index = 0;
     public int findPeakElement(int[] num) {
         findPeakHelper(num, 0, num.length-1);
         return index;
     }
     private boolean findPeakHelper(int[] num,int begin,int end){
         if(begin > end)
             return false;
         int mid = (begin + end)/2;
         if(mid == 0)
         {
             if(mid+1 < num.length && num[mid+1] < num[mid]){
                 index = mid;
                 return true;
             }else {
                 return findPeakHelper(num, mid+1, end);
             }
         }

         if(mid-1 >= 0 && mid == num.length-1){
             if(num[mid-1] < num[mid]){
                 index = mid;
                 return true;
             }else{
                 return findPeakHelper(num, begin, mid-1);
             }
         }

         if(num[mid-1] < num[mid] && num[mid+1] < num[mid]){
             index = mid;
             return true;
         }

         if(findPeakHelper(num, begin, mid-1))
             return true;
         else {
             return findPeakHelper(num, mid+1, end);
         }
     }
 }