Leetcode 162. Find Peak Element

小白菜又菜

已于 2023-02-26 00:00:47 修改

阅读量134

点赞数

分类专栏： Leetcode 解题报告文章标签： leetcode 算法职场和发展

于 2023-02-25 23:50:20 首次发布

本文链接：https://blog.csdn.net/mobius_strip/article/details/129222172

版权

解题报告同时被 2 个专栏收录

1392 篇文章

订阅专栏

Leetcode

168 篇文章

订阅专栏

Problem

A peak element is an element that is strictly greater than its neighbors.

Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.

You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array.

You must write an algorithm that runs in O(log n) time.

Algorithm

Using bineary search. If nums[Mid] > nums[Mid], there will a peak in the front half part, else there will be a peak in the second half part.

Code

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]:
                R = Mid
            else:
                L = Mid+1
        return R