我们把符合下列属性的数组 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 的值。
示例 1:
输入:[0,1,0]
输出:1
示例 2:
输入:[0,2,1,0]
输出:1
提示:
3 <= A.length <= 10000
0 <= A[i] <= 10^6
A 是如上定义的山脉
二分查找
class Solution(object):
def peakIndexInMountainArray(self, A):
"""
:type A: List[int]
:rtype: int
"""
low = 0
high = len(A)-1
while low<=high:
mid = (low+high)//2
if A[mid-1]<A[mid] and A[mid]>A[mid+1]:
return mid
elif A[mid-1]<A[mid]<A[mid+1]:
low = mid+1
elif A[mid-1]>A[mid]>A[mid+1]:
high = mid-1
成功
显示详情
执行用时 : 92 ms, 在Peak Index in a Mountain Array的Python提交中击败了89.25% 的用户
内存消耗 : 12.8 MB, 在Peak Index in a Mountain Array的Python提交中击败了37.33% 的用户
或者:…emmmm
class Solution(object):
def peakIndexInMountainArray(self, A):
"""
:type A: List[int]
:rtype: int
"""
a = max(A)
return A.index(a)