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 < 2)
            return 0;
        int max = nums[0], index = 0;
        for(int i = 1; i < n; i++){
            if(nums[i]>nums[i-1]){
                index = i;
                max = nums[i];
            }
        }
        return index;
    }
};