852. 山脉数组的峰顶索引
我们把符合下列属性的数组 A 称作山脉:
-
A.length >= 3
-
存在 0 < i < A.length - 1 使得A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1
给定一个确定为山脉的数组,返回任何满足 A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1] 的 i 的值
解法一:老老实实用二分查找
class Solution:
def peakIndexInMountainArray(self, A: List[int]) -> int:
low,high = 0,len(A)-1
while low<high:
mid = (low+high)//2
if A[mid-1]<A[mid]<A[mid+1]:
low = mid+1
elif A[mid+1]<A[mid]<A[mid-1]:
high = mid-1
else:
return mid
return low
解法二:直接调用库函数,一行代码就能解决
class Solution:
def peakIndexInMountainArray(self, A: List[int]) -> int:
return A.index(max(A))