当前位置：网站首页>LeetCode 162. Finding Peaks (Moderate)

LeetCode 162. Finding Peaks (Moderate)

2022-08-10 05:54:00 【Shengxin Research Ape】

python

class Solution:def findPeakElement(self, nums: List[int]) -> int:if(len(nums)==1):return 0if(nums[0]>nums[1]):return 0if(nums[len(nums)-1]>nums[len(nums)-2]):return len(nums)-1'''Complexity O(n)i = 1while(1):if(nums[i]>nums[i-1] and nums[i]>nums[i+1]):breaki +=1return i'''#dichotomyleft = 0right = len(nums)-1while(leftnums[mid+1]):right = midelse:left = mid +1return left

版权声明
本文为[Shengxin Research Ape]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/222/202208100529370879.html

边栏推荐

猜你喜欢