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.

问题分析：寻找数组中的峰值元素，既然是峰值元素，则它大于它的邻居，因此我们只需要在数组中找转折点就可，如果遍历完数组仍然没有找到，说明最后一个元素就是数组中的最大元素，另外题目假设了-1和size处的元素为负无穷，实现代码如下：时间复杂度为O(n),可以优化。

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