Find Peak Element

Catalogue：array-分治法

Question：

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.

Analysis

时间复杂度要达到O(logn)必须用分治法。

如果array[mid-1]大于array[mid]，则左边的子数组array[start..mid-1]肯定有peak element（因为array[start]总是大于左边的元素）；同样地，如果array[mid+1]大于array[mid]，则由边的子数组array[mid+1..end]肯定有peak element（因为array[end]总是大于右边的元素）。

First try

class Solution {
public:
    int findPeakElement(const vector<int> &num) {
        int ret = 0;
        for(int i = 1; i < num.size(); i++)
        {
            if(num[i]>num[i-1])
            {
               ret = num[i];
            }
            else if(ret == num[i-1])
            {
                return ret;
            }
        }
        return ret;
    }
};

Result: Wrong!要求返回的是下标，而不是值

Second try

class Solution {
public:
    int findPeakElement(const vector<int> &num) {
        int ret = 0;
        for(int i = 1; i < num.size(); i++)
        {
            if(num[i]>num[i-1])
            {
               ret = i;
            }
            else if(num[ret] == num[i-1])
            {
                return ret;
            }
        }
        return ret;
    }
};

Result: Accepted
Time Complexity：O(n)

Third try

<span style="color:#333333;">class Solution {
public:
    int findPeakElement(const vector<int> &num) {
        return binarySearch(num,0,num.size()-1);
    }
    
    int binarySearch(const vector<int> &num, int start, int end)
    {
        </span><span style="color:#cc0000;">if(end - start == 1)</span><span style="color:#333333;">
        {
            return(num[end]>num[start]?end:start);
        }
        int mid = (start+end) >>1;
        if(num[mid]<num[mid+1])
        {
            return binarySearch(num,mid+1,end);
        }
        else if(num[mid]<num[mid-1])
        {
            return binarySearch(num,start,mid-1);
        }
        else
        {
            return mid;
        }
    }
};</span>

Result: Runtime error! 二分法的临界情况可能是start和end差1，也可能是start==end

Fourth Try

class Solution {
public:
    int findPeakElement(const vector<int> &num) {
        return binarySearch(num,0,num.size()-1);
    }
    
    int binarySearch(const vector<int> &num, int start, int end)
    {
        if(end - start <= 1)
        {
            return(num[end]>num[start]?end:start);
        }
        int mid = (start+end) >>1;
        if(num[mid]<num[mid+1])
        {
            return binarySearch(num,mid+1,end);
        }
        else if(num[mid]<num[mid-1])
        {
            return binarySearch(num,start,mid-1);
        }
        else
        {
            return mid;
        }
    }
};

Result: Accepted

Time Complexity: O(logn)