Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
use heapq solution in Clear category for The Final Stone by kdim
import heapq
def final_stone(stones: list[int]) -> int:
n = len(stones) - 1
stones = list(map(lambda x: -1 * x, stones))
heapq.heapify(stones)
for _ in range(n):
heapq.heappush(stones, heapq.heappop(stones) - heapq.heappop(stones))
return -heapq.heappop(stones) if stones 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. 11, 2022
Comments:
