LeetCode 162. Find Peak Element

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.
Example 2:

Input: nums = [1,2,1,3,5,6,4]
Output: 1 or 5
Explanation: Your function can return either index number 1 where the peak element is 2,
or index number 5 where the peak element is 6.
题目 大意 给出一个数组 寻找数组中的峰值（比邻居大）并且在这个题目中 规定nums[-1] = nums[n] = -∞.

假定 nums[i-1]和 nums[i]进行比较 如果nums[i]>num[i-1] 并且 nums[i]…nums[n-1]保持单调 则峰值为 nums[n-1] 。如果在nums[i]到nums[n-1]不单调 这说明在这个区间内一定存在 峰值
如此 我们可以找到一个mid进行比较 从而可以将范围缩小至一般 所以这里用二分法来解决。
（有点绕。。推荐手写一下）

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
     int l=0,r=nums.size()-1;
     while(l<r)
     {
         int mid=(l+r+1)/2;
         if(nums[mid]>nums[mid-1])
             l=mid;
         else
             r=mid-1;
    }
        return l;
    }
};