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.

题目翻译

找到数组中的峰值，假定输入中num[i] != num[i+1]。数组中可能含有多个峰值，只需要求出一个即可。
可以想象num[-1]和num[n]为负无穷。

分析

首先当然是暴力法。遍历数组，然后判断A[i]是否A[i] > A[i-1]和A[i] > A[i+1]

因为题目并不要求求出全部峰值，所以我们分析题目特性。
1，A[i] > A[i+1] & A[i] < A[i-1] ,此时，峰值只能在A[i-1] 左边。
2，A[i] < A[i+1] & A[i] > A[i-1]，此时，峰值只能在A[i+1]右边。
3，A[i] > A[i-1]&A[i] > A[i+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;
    }
};