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.

方法一：

方法一：O(n)，n次比较。

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;
    }
};

解释：由题意，num[-1] = num[n] = -∞，所以该数组 从下标-1开始 到下标n 一定是先递增再递减 一定存在一个波峰

方法二：

O(log(n))
⚠ 注意这里不是传统的mid 和 left、right比较，而是mid和mid+1 比较，若mid < mid+1 说明在上升阶段，left = mid+1，否则在下降阶段，right = mid

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