| 山脉数组的峰顶索引
符合下列属性的数组 arr 称为 山脉数组 :
arr.length >= 3
存在 i(0 < i < arr.length - 1)使得:
arr[0] < arr[1] < ... arr[i-1] < arr[i]
arr[i] > arr[i+1] > ... > arr[arr.length - 1]
给你由整数组成的山脉数组 arr ,返回任何满足 arr[0] < arr[1] < ... arr[i - 1] < arr[i] > arr[i + 1] > ... > arr[arr.length - 1] 的下标 i 。
示例 1:
输入:arr = [0,1,0]
输出:1
示例 2:
输入:arr = [0,2,1,0]
输出:1
示例 3:
输入:arr = [0,10,5,2]
输出:1
示例 4:
输入:arr = [3,4,5,1]
输出:2
示例 5:
输入:arr = [24,69,100,99,79,78,67,36,26,19]
输出:2
提示:
3 <= arr.length <= 104
0 <= arr[i] <= 106
题目数据保证 arr 是一个山脉数组
进阶:很容易想到时间复杂度 O(n) 的解决方案,你可以设计一个 O(log(n)) 的解决方案吗?
题解
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/4f9f900a955a21716f4337ebc08e9426.png#pic_center)
class Solution:
def peakIndexInMountainArray(self, arr: List[int]) -> int:
length = len(arr)
first = 0
last = length - 1
while last >= first:
mid = first + (last-first)//2
if mid == 0:
return last
if arr[mid] > arr[mid-1] and arr[mid] > arr[mid+1]:
return mid
elif arr[mid] > arr[mid-1] and arr[mid] < arr[mid+1]:
first = mid + 1
elif arr[mid] > arr[mid+1] and arr[mid] < arr[mid-1]:
last = mid - 1