162. 寻找峰值

1
2
3
4
5
6
7
8
9
10
11
12
class Solution:
def findPeakElement(self, nums: List[int]) -> int:
left = 0
right = len(nums)-1
while left<=right:
mid = (left+right)>>1
print(mid)
if mid+1<len(nums) and nums[mid]<=nums[mid+1]:
left = mid+1
else:
right = mid-1
return left