LeetCode - Last Stone Weight(1046)

Heap - Easy

class Solution:
    def lastStoneWeight(self, stones: List[int]) -> int:
        
        if len(stones) == 1:
            return stones[0]
        
        while len(stones) > 1:
            if len(stones) == 2:
                sub = stones[0] - stones[1]
                if sub == 0:
                    return 0
                else:
                    return abs(sub)
            
            stones.sort()
            sub = stones[len(stones) - 1] - stones[len(stones) - 2]
            
            if sub == 0:
                stones = stones[:len(stones) - 2]
            else:
                stones = stones[:len(stones) - 2]
                stones.append(abs(sub))
                        
        return stones[0]