Last Stone Weight Python Solution with Tests

lcpy gen -n 1046   # by problem number
lcpy gen -s last_stone_weight   # by problem name

Input: stones = [2,7,4,1,8,1]
Output: 1
Explanation:
We combine 7 and 8 to get 1 so the array converts to [2,4,1,1,1] then,
we combine 2 and 4 to get 2 so the array converts to [2,1,1,1] then,
we combine 2 and 1 to get 1 so the array converts to [1,1,1] then,
we combine 1 and 1 to get 0 so the array converts to [1] then that's the value of the last stone.

Input: stones = [1]
Output: 1

import heapq


class Solution:
    # Time: O(n log n)
    # Space: O(n)
    def last_stone_weight(self, stones: list[int]) -> int:
        max_heap = [-stone for stone in stones]
        heapq.heapify(max_heap)

        while len(max_heap) > 1:
            heaviest = -heapq.heappop(max_heap)
            second = -heapq.heappop(max_heap)
            if heaviest != second:
                heapq.heappush(max_heap, -(heaviest - second))

        return -max_heap[0] if max_heap else 0