LeetCode-162. Find Peak Element

Description

A peak element is an element that is greater than its neighbors.

Given an input array nums, 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] = -∞.

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.

Solution 1(C++)

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

Solution 2(C++)

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

算法分析

这道题，有点莫名其妙，所以差评的人也挺多的，但是呢，我们可以就拿来锻炼锻炼程序思维嘛。解法一是自己写的，分类讨论。解法二有点意思，反向思维。其实要找这种峰值点，换个角度就是找到数组的元素值开始下落的时候就可以了。

所以这种反向思维，在这一道题可能还OK，但是也许其他题目就是杀招了。还是要注意一下。

程序分析

略。