Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for The Final Stone by mortonfox
from heapq import heapify, heappop, heappush
def final_stone(stones: list[int]) -> int:
if not stones: return 0
stones = [-s for s in stones]
heapify(stones)
while len(stones) > 1:
a = heappop(stones)
b = heappop(stones)
heappush(stones, a - b)
return -stones[0]
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!")
Sept. 9, 2022
Comments: