Last Stone Weight LeetCode solution in Python

1
# Runtime: 59 ms (Top 27.86%) | Memory: 13.9 MB (Top 62.57%)
2
class Solution:
3
    def lastStoneWeight(self, stones: List[int]) -> int:
4
        stones = [-x for x in stones]
5
        heapq.heapify(stones)
6

7
        while len(stones) > 1:
8
            mx1 = -heapq.heappop(stones)
9
            mx2 = -heapq.heappop(stones)
10
            if mx1 - mx2:
11
                heapq.heappush(stones, -(mx1 - mx2))
12

13
        if len(stones):
14
            return -heapq.heappop(stones)
15
        return 0