LeetCode - 162. Find Peak Element - 思路详解 - C++

题目

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.

翻译

一个峰值元素，即该元素大于左右邻接元素

假设给定数组中元素，num[i] != num[i+1]。找出数组中的峰值元素并返回其索引。

这个数组可能包含多个峰值，在这种情况下，返回任意一个索引都是可以的。

你可以想想num[-1]和num[n]为负无穷。

思路

思路1，采用暴力法，即遍历数组，对比左右，时间复杂度为O(n)

思路2，采用二分查找法。
首先定义两个游标，start和end。得到中间索引mid = (start+end)/2；

• 1，如果num[mid-1] < num[mid] 且 num[mid] < num[mid+1] 则说明，峰值在右半部分。start = mid+1
• 2，如果num[mid-1] > num[mid] 且 num[mid] > num[mid+1]，则说明，峰值在左半部分。end = mid-1
• 3，如果num[mid-1] < num[mid] 且 num[mid] > num[mid+1]，则mid处就是峰值。
• 4，如果num[mid-1] > num[mid] 且 num[mid] < num[mid+1]，则说明该数组不止一个峰值，此时start = mid+1，或者end = mid-1均可。
• -

代码

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int len = nums.size()-1;
        int start = 0;
        int end = nums.size()-1;

        if(nums.size() == 1){
            return 0;
        }
        //首先判断首尾是否存在
        if(nums[0] > nums[1]){
            return 0;
        }

        if(nums[len] > nums[len-1]){
            return len;
        }

        while(start <= end){
            int mid = (start+end)/2;
            if(nums[mid] > nums[mid+1] && nums[mid-1] < nums[mid]){
                return mid;
            }else{
                if(nums[mid] < nums[mid+1] && nums[mid-1] < nums[mid]){
                    start = mid+1;
                }

                if(nums[mid] > nums[mid+1] && nums[mid-1] > nums[mid] ){
                    end = mid-1;
                }

                if(nums[mid] < nums[mid+1] && nums[mid-1] > nums[mid]){
                    start = mid+1;
                }
            }
        }
        return start;
    }



};