class Solution:
def findPeakElement(self, nums: list[int]) -> int:
start = 0
end = len(nums) - 1
while(start <= end):
mid = start + (end - start) // 2
if(end - start == 0):
return mid
if(end - start == 1):
if(nums[end] > nums[start]):
return end
else:
return start
if(nums[mid] < nums[mid-1]):
end = mid - 1
else:
start = mid
return mid
if __name__ == "__main__":
nums = [8,9,5,4,2,1,6]
res = Solution().findPeakElement(nums)
print(res)
寻找峰值1
最新推荐文章于 2024-10-02 10:53:34 发布