题目描述:
二分法:
class Solution: def findPeakElement(self, nums: List[int]) -> int: l, h = 0, len(nums) - 1 while l <= h: m = (l + h) // 2 if (not m or nums[m-1] < nums[m]) and (m == len(nums) - 1 or nums[m] > nums[m+1]): return m elif not m or nums[m] > nums[m-1]: l = m + 1 else: h = m - 1