二分法:
当num[mid] > num[mid+1]时 ,处于下坡阶段,峰值在左边,r=mid
当num[mid] <= num[mid+1]时,处于上坡阶段,峰值在右边,l=mid+1
最后返回l,即为其中一个峰值点
class Solution:
def findPeakElement(self, nums):
l=0
r=len(nums)-1
while(l<r):
mid = (l+r>>1)
if nums[mid] > nums[mid+1]:
r = mid
else:
l = mid + 1
return l