-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path162-find_peak_element.py
53 lines (41 loc) · 1.43 KB
/
162-find_peak_element.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
"""
https://leetcode.com/problems/find-peak-element/submissions/
Runtime: O(log n) runtime, O(1) space
Runtime: 28 ms, faster than 92.57% of Python online submissions for Find Peak Element.
Memory Usage: 12.7 MB, less than 8.11% of Python online submissions for Find Peak Element.
"""
class Solution(object):
def findPeakElement(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
left = 0
right = len(nums) - 1
while left < right:
mid = left + (right - left) / 2
#check if we're at local max
if nums[mid] > nums[mid+1] and nums[mid] > nums[mid-1]:
return mid
#binary search
if nums[mid] < nums[mid+1]:
left = mid + 1 #recurse on right side
else:
right = mid - 1 #recurse on left side
return left
def findPeakElement(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
left = 0
right = len(nums) - 1
while left < right:
mid = left + (right - left) / 2
#pick which side to recurse on--
#choose the side with the bigger number
if nums[mid + 1] > nums[mid]:
left = mid + 1 #recurse on right side
else:
right = mid #recurse on left side
return left