Find Peak Element

先给出一个时间复杂度是O(n)的常规算法：

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

再给出一个时间复杂度是logN的,二分查找

class Solution {
public:
    int findPeakElement(const vector<int> &num) {
            int low=0;
            int high=num.size()-1;
            while(low<=high)
            {
                if(high==low)
                   return low;
                int mid=low+(high-low)/2;
                if(num[mid]<num[mid+1])
                   low=mid+1;
                else
                   high=mid;
            }
            
    }
};