[Leetcode] 162. Find Peak Element (直接求/二分法)

162. Find Peak Element（题目链接）

Medium

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.

Follow up: Your solution should be in logarithmic complexity.

 

方法1：直接求， 遍历

class Solution:
    def findPeakElement(self, nums: List[int]) -> int:
        n1, n2 = float('-inf'), nums[0]
        if len(nums) == 1:
            n3 = float('-inf')
        else:
            n3 = nums[1]
        for i in range(len(nums)):
            if n2 > n1 and n2 > n3:
                return i
            n1 = nums[i]
            n2 = nums[i + 1]
            n3 = float('-inf') if i + 2 >= len(nums) else nums[i+2]
            

 

方法2：二分法

二分法的关键是需要nums[mid]与target的比较，这里的target就是nums[mid + 1]

class Solution:
    def findPeakElement(self, nums: List[int]) -> int:
        l, r = 0, len(nums) - 1
        while l < r:
            mid = (l + r) // 2
            if nums[mid] < nums[mid + 1]:
                l = mid + 1
            else:
                r = mid
        return l