-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path162.py
More file actions
45 lines (35 loc) · 1.18 KB
/
Copy path162.py
File metadata and controls
45 lines (35 loc) · 1.18 KB
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
class Solution:
def findPeakElement(self, nums):
if not len(nums):
return -1
if len(nums) == 1:
return 0
def bs(low, high):
## returns peak
peak = -1
# print(low, high)
mid_num = (low + high) // 2
if mid_num == 0:
if nums[mid_num + 1] < nums[mid_num]:
return mid_num
else:
return mid_num + 1
elif mid_num == len(nums) - 1:
if nums[mid_num - 1] < nums[mid_num]:
return mid_num
else:
if nums[mid_num - 1] < nums[mid_num] > nums[mid_num + 1]:
return mid_num
else:
if nums[mid_num - 1] > nums[mid_num]:
return bs(low, mid_num)
elif nums[mid_num + 1] > nums[mid_num]:
return bs(mid_num, high)
else:
print('Not this case')
return -1
return bs(0, len(nums) - 1)
s = Solution()
# inp = [1,2,3,1]
inp = [-1, -1, -1]
print(s.findPeakElement(inp))