执行用时:40 ms
内存消耗:14.5 MB
class Solution:
def peakIndexInMountainArray(self, arr: List[int]) -> int:
left = 0
right = len(arr) - 1
while left <= right:
mid = left + (right - left) // 2
if arr[mid-1] < arr[mid] > arr[mid+1]:
return mid
elif arr[mid - 1] > arr[mid]:
right = mid -1
elif arr[mid + 1] > arr[mid]:
left = mid + 1
return mid
依旧是采用二分查找的思路,以mid为中心将左右切割成两个数组,再确定划分条件:如果左右都小于arr[mid],则输出mid;如果左大于arr[mid],则说明山峰在左侧数组;右侧同理。