mirror of
https://gitlab.com/mfocko/CodeWars.git
synced 2024-11-12 20:40:28 +01:00
18 lines
432 B
Python
18 lines
432 B
Python
|
def find_missing(sequence):
|
||
|
|
# Relation => a_n - a_(n-1) = d
|
||
|
|
|
||
|
|
diffs = []
|
||
|
|
|
||
|
|
for i in range(len(sequence) - 1):
|
||
|
|
diffs.append(sequence[i + 1] - sequence[i])
|
||
|
|
|
||
|
|
max_diff = diffs[0]
|
||
|
|
|
||
|
|
for index, diff in enumerate(diffs[1:], 1):
|
||
|
|
if abs(diff) > abs(max_diff):
|
||
|
|
return sequence[index] + max_diff
|
||
|
|
elif abs(max_diff) > abs(diff):
|
||
|
|
return sequence[0] + diff
|
||
|
|
|
||
|
|
raise ValueError()
|