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.

分析：

对于任意一个数组，只要其满足num[-1] = num[n] = -∞，且每个元素互不相等，那么必然存在局部最大值。如果数组是单调递增的，那么峰值就是最后一个元素；如果数组是单调递减的，那么峰值就是就是第一个元素；如果数组存在先增后减的区间，那么峰值显而易见；如果数组存在先减后增的区间，那么区间第一个和最后一个元素都是峰值。

因此，这道题可以使用二分查找法，通过判断先后区间是否满足上述条件从而确定峰值一定在哪个区间，递归或迭代处理那个区间就好了。

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        //二分法
        int first = 0, last = nums.size() - 1;
        while (first < last) 
        {
            int mid = first + (last - first) / 2;
            //为什么不用担心mid+1越界呢？因为如果first < last, 那么mid < last, 而last不越界
            if (nums[mid] > nums[mid + 1]) //峰值一定在区间[first, mid]
            {
                last = mid;
            }
            else //峰值一定在区间[mid+1, last]
            {
                first = mid + 1;
            }
        }
        
        return last;
    }
};