leetcode Find Peak Element python

寻找峰元素：算法与实现

最新推荐文章于 2025-09-06 09:26:50 发布

转载最新推荐文章于 2025-09-06 09:26:50 发布 · 91 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/bthl/p/4574516.html

文章标签：

#python

本文介绍如何在不重复的整数数组中找到峰元素及其索引位置，重点阐述了算法逻辑与代码实现，包括边界条件判断及内部元素比较。

Find Peak Element

A peak element is an element that is greater than its neighbors.

Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.

The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.

You may imagine that num[-1] = num[n] = -∞.

For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number 2.

python code:

class Solution:
# @param nums, an integer[]
# @return an integer
def findPeakElement(self, nums):
　　if len(nums)==1 or nums[0]>nums[1]: 　　　　　　　　#边界条件判定
　　　　　return 0
　　else:
　　　　for i in range(1,len(nums)-1):
　　　　　　if nums[i]>nums[i-1] and nums[i]>nums[i+1]: 　　#第2个到第n-1个的判定
　　　　　　　　return i
　　　　else: 　　#for正常结束，第n个为peak number
　　　　　　return len(nums)-1

转载于:https://www.cnblogs.com/bthl/p/4574516.html