forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFind Peak Element.py
29 lines (27 loc) · 947 Bytes
/
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
class Solution:
"""
we can solve this problem using binary search
"""
def findPeakElement(self, nums: List[int]) -> int:
if len(nums) == 1:
return 0
def search(low, high, nums):
mid = (low + high) // 2
if mid == 0:
if nums[mid] < nums[mid+1]:
return search(mid+1, high, nums)
else:
return mid
elif mid == len(nums)-1:
if nums[mid] < nums[mid-1]:
# goto left
return search(low, mid-1, nums)
else:
return mid
elif nums[mid] < nums[mid-1]:
# goto left
return search(low, mid-1, nums)
elif nums[mid] < nums[mid+1]:
# goto right
return search(mid+1, high, nums)
return mid