leetcode - 852. Peak Index in a Mountain Array

KpLn_HJL

已于 2023-12-23 15:02:59 修改

阅读量224

点赞数

分类专栏： OJ题目记录文章标签： leetcode java 算法

于 2023-07-25 13:58:18 首次发布

本文链接：https://blog.csdn.net/sinat_41679123/article/details/131916286

版权

OJ题目记录专栏收录该内容

515 篇文章 1 订阅

订阅专栏

该问题要求在给定的山脉数组中找到峰值的索引，即找到数组中从左向右最大值后紧接着从右向左最大值的位置。解决方案是使用二分查找算法，通过比较中间元素与其相邻元素的关系来缩小搜索范围。在O(logn)的时间复杂度内找到目标索引，且空间复杂度为O(1)。

摘要由CSDN通过智能技术生成

Description

An array arr a mountain if the following properties hold:

arr.length >= 3
There exists some i with 0 < i < arr.length - 1 such that:
arr[0] < arr[1] < ... < arr[i - 1] < arr[i] 
arr[i] > arr[i + 1] > ... > arr[arr.length - 1]
Given a mountain array arr, return the index i such that arr[0] < arr[1] < ... < arr[i - 1] < arr[i] > arr[i + 1] > ... > arr[arr.length - 1].

You must solve it in O(log(arr.length)) time complexity.

Example 1:

Input: arr = [0,1,0]
Output: 1

Example 2:

Input: arr = [0,2,1,0]
Output: 1

Example 3:

Input: arr = [0,10,5,2]
Output: 1

Constraints:

3 <= arr.length <= 10^5
0 <= arr[i] <= 10^6
arr is guaranteed to be a mountain array.

Solution

Use binary search to solve this problem. For any middle index, it either locates at the left of the peak, or the right of the peak. If at the left, then discard the left half, otherwise discard the right half.

Time complexity: $o(\log n)$
Space complexity: $o (1)$

Code

class Solution:
    def peakIndexInMountainArray(self, arr: List[int]) -> int:
        left, right = 0, len(arr) - 1
        while left < right:
            mid = (left + right) >> 1
            if arr[mid - 1] < arr[mid] and arr[mid + 1] < arr[mid]:
                return mid
            elif arr[mid - 1] < arr[mid]:
                left = mid + 1
            elif arr[mid + 1] < arr[mid]:
                right = mid