leetcode 【 Find Peak Element 】python 实现

题目：

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.

代码：

分别用递归和非递归两种方法实现。

非递归版代码：oj测试通过 Runtime: 55 ms

 1 class Solution:
 2     # @param num, a list of integer
 3     # @return an integer
 4     def findPeakElement(self, num):
 5         if len(num) == 1 :
 6             return 0
 7         if len(num) == 2 :
 8             return [0,1][num[0] < num[1]]
 9         start = 0
10         end = len(num)-1
11         while start <= end:
12             if start == end:
13                 return start
14             if start+1 == end:
15                 return [start,end][num[start] < num[end]]
16             mid = (start+end)/2
17             if num[mid] < num[mid-1]:
18                 #start = 0
19                 end = mid -1
20             elif num[mid] < num[mid+1]:
21                 start = mid+1
22                 #end = len(num)-1
23             else:
24                 return mid

递归代码：oj测试通过 Runtime: 51 ms

 1 class Solution:
 2     # @param num, a list of integer
 3     # @return an integer
 4     def find(self,num,start,end):
 5         if start == end :
 6             return start
 7         if end == start + 1:
 8             if num[start] < num[end] :
 9                 return end
10             else:
11                 return start
12         mid = (start+end)/2
13         if num[mid] < num[mid-1] :
14             return self.find(num, start, mid-1)
15         if num[mid] < num[mid+1] :
16             return self.find(num, mid, end)
17         return mid
18
19     def findPeakElement(self, num):
20         if len(num) == 1:
21             return 0
22         return self.find(num, 0, len(num)-1)

思路：

二分查找思路升级版。参照如下两篇日志的思路：

http://bookshadow.com/weblog/2014/12/06/leetcode-find-peak-element/

http://blog.csdn.net/u010367506/article/details/41943309

这道题在理解题意上需要注意就是默认这个数组的虚头和虚尾都是负无穷，并且这个数组不存在相等的两个元素，这样就一定能够找到题中描述的peak point.

转载于:https://www.cnblogs.com/xbf9xbf/p/4242949.html

leetcode 【 Find Peak Element 】python 实现相关推荐

LeetCode：Find Peak Element - 寻找一个数组内的顶点
2019独角兽企业重金招聘Python工程师标准>>> 1.题目名称 Find Peak Element(寻找一个数组内的顶点) 2.题目地址 https://leetcode.co ...
leetcode 162. Find Peak Element | 162. 寻找峰值（二分法找局部最大值）
题目 https://leetcode.com/problems/find-peak-element/ 题解 2021-7-21 16:28:31 更新版思路: 根据左神在课上说的,可以使用二分法 ...
LeetCode刷题之python解法（持续更新）
1. Two Sum 4行 class Solution:def twoSum(self, nums: List[int], target: int) -> List[int]:d = {}fo ...
[LeetCode] 169. Majority Element 多数元素
Given an array of size n, find the majority element. The majority element is the element that appear ...
【原创】leetCodeOj --- Find Peak Element 解题报告
题目地址: https://oj.leetcode.com/problems/find-peak-element/ 题目内容: A peak element is an element that is ...
75. Find Peak Element 【medium】
75. Find Peak Element [medium] There is an integer array which has the following features: The numbe ...
【数组】Find Peak Element
题目: A peak element is an element that is greater than its neighbors. Given an input array where num[ ...
LeetCode——Kth Largest Element in an Array
LeetCode--Kth Largest Element in an Array Question Find the kth largest element in an unsorted array ...
LeetCode 其他部分简单 Python实现
#LeetCode 其他部分简单 Python实现 ''' 位1的个数编写一个函数,输入是一个无符号整数,返回其二进制表达式中数字位数为 '1' 的个数(也被称为汉明重量).示例 : 输入: 11 ...

leetcode 【 Find Peak Element 】python 实现

leetcode 【 Find Peak Element 】python 实现相关推荐

最新文章

热门文章