Leetcode——162. Find Peak Element

题目原址

https://leetcode.com/problems/find-peak-element/description/

题目描述

A peak element is an element that is greater than its neighbors.
Given an input array nums, where nums[i] ≠ nums[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 nums[-1] = nums[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.

解题思路

题中要求给定一个数组，数组中相邻的元素不相同，找到数组中的峰值元素，其中峰值元素是指其值大于左边的元素并且大于右边的元素值，给定的数组可能有多个峰值元素，只需要返回其中一个峰值元素的下标即可。

思路：
首先明确两点，如果nums[i] > nums[i + 1]说明i前面一定存在峰值元素，如果nums[i] < nums[i + 1]那么i + 1后面一定存在峰值元素。所以现在可以把问题归结为二分查找问题。定义一个变量left指向数组中左边第一个元素，right指向数组右边第一个元素，medium指向left和right 中间的元素，进行二分查找判断即可。

AC代码

class Solution {
    public int findPeakElement(int[] nums) {
        int left = 0;
        int right = nums.length - 1, medium = (left + right) / 2;
        while(left < right) {
            medium = (left + right) / 2;
            if(nums[medium] < nums[medium + 1])
                left = medium + 1;
            else
                right = medium;
        }
        return right;        
    }
}