-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlargest_range.py
More file actions
43 lines (36 loc) · 1.1 KB
/
Copy pathlargest_range.py
File metadata and controls
43 lines (36 loc) · 1.1 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
def largestRange(array):
# Write your code here.
# Sort it, then determine longest continuation?
# To improve this, could use a dictionary and iterate through keys
array.sort()
max_range_len = 0
max_range_start = 0
curr_range_len = 0
curr_range_start = 0
curr_range_bool = False
array_set = set(array)
array_list = list(array_set)
array_list.sort()
if len(array_list) == 1:
return [array_list[0],array_list[0]]
for idx, value in enumerate(array_list):
if idx == 0:
pass
elif value == array_list[idx - 1] + 1:
if curr_range_bool == False:
curr_range_bool = True
curr_range_start = array_list[idx - 1]
curr_range_len = 1
else:
curr_range_len += 1
elif curr_range_bool:
curr_range_bool = False
if curr_range_len > max_range_len:
max_range_len = curr_range_len
max_range_start = curr_range_start
curr_range_len = 0
curr_range_start = 0
if curr_range_len > max_range_len:
max_range_len = curr_range_len
max_range_start = curr_range_start
return [max_range_start, max_range_start + max_range_len]