在无序数组中随便找出一个极大值

A peak element is an element that is greater than its neighbors.

Given an input array nums, where nums[i] ≠ nums[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 nums[-1] = nums[n] = -∞.

Example 1:

Input: nums = [1,2,3,1]
Output: 2
Explanation: 3 is a peak element and your function should return the index number 2.

/* 找一个局部极大值 对数时间内完成
 * 显然用二分搜索
 * 想象有一堆山头
 * low    mid1   mid2   high
 * mid2 > mid1 说明mid在上升的山头 在mid2 - high继续搜索
 * mid2 < mid1 mid在下降的山头  在low -mid1继续搜索
 * 最终会收敛到一个山头 即 mid2==mid1 ?
 * */
class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int l=0, r=nums.size()-1, mid1, mid2;
        while(l<r){
            mid1 = (l+r)/2;
            mid2 = mid1+1;
            //cout<<mid1<<" "<<mid2<<endl;
            if(nums[mid2] > nums[mid1]) l = mid2;
            else r = mid1;
            //cout<<"  "<<l<<" "<<r<<endl;
        }
        return l;
    }
};