leetcode 【 Find Peak Element 】python 实现

最新推荐文章于 2021-12-17 23:50:15 发布

转载最新推荐文章于 2021-12-17 23:50:15 发布 · 86 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/xbf9xbf/p/4242949.html

本文详细介绍了使用递归和非递归两种方法实现二分查找法来解决找峰点问题。文章深入剖析了算法逻辑，包括如何通过比较数组元素来确定峰点的位置，并通过实例演示了算法的具体应用。

题目：

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)