Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Sort subtract put back return result solution in Clear category for The Final Stone by akamus
def final_stone(stones: list[int]) -> int:
# sort the list, pop and subtract the two last position higher ints until left with 2 elements.
while len(stones) >= 2:
stones = sorted(stones)
a = stones.pop(-1)
b = stones.pop(-1)
temp_res = a - b
stones.append(temp_res)
return stones[0] if len(stones) == 1 else 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, 2024
