↓ 跳过正文
  1. 科学/
  2. 计算机/
  3. 算法/
  4. Leetcode/
  5. 0100-0199/

0162 寻找峰值

Solution

from typing import List

class Solution:
    def findPeakElement(self, nums: List[int]) -> int:
        left, right = 0, len(nums) - 1
        while left < right:
            mid = (left + right) >> 1
            if nums[mid] > nums[mid + 1]:
                right = mid
            else:
                left = mid + 1
        return left

if __name__ == "__main__":
    sol = Solution()
    print(sol.findPeakElement([1,2,3,1]))
    print(sol.findPeakElement([1,2,1,3,5,6,4]))