Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Recursion solution in Clear category for The Final Stone by Kolia951
def final_stone(data: list[int]) -> int:
data = sorted(data, reverse=True)
if not data:
return 0
elif len(data) == 1:
return data[0]
else:
stone1, stone2 = data[0:2]
return final_stone(data[2:] + [stone1 - stone2])
print('Example:')
print(final_stone([1,2,3]))
assert final_stone([3, 5, 1, 1, 9]) == 1
assert final_stone([1, 2, 3]) == 0
assert final_stone([1, 2, 3, 4]) == 0
assert final_stone([1, 2, 3, 4, 5]) == 1
assert final_stone([1, 1, 1, 1]) == 0
assert final_stone([1, 1, 1]) == 1
assert final_stone([1, 10, 1]) == 8
assert final_stone([1, 10, 1, 8]) == 0
assert final_stone([]) == 0
assert final_stone([1]) == 1
assert final_stone([10, 20, 30, 50, 100, 10, 20, 10]) == 10
print("The mission is done! Click 'Check Solution' to earn rewards!")
Dec. 2, 2022
Comments:
