162. 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.

寻找峰值，可以按照循序查找，如果这个数刚好在数组内部，比左边和右边的数都大，那么就是峰值。

如果在两端的话，在数组的左端只需比右边的第一个数大就是峰值，右边也是同样的道理。

我们可以按逐个查找，不过花费的时间比较长，我们这里用二分查找进行查找会快速很多。

详情看代码。

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