https://leetcode.com/problems/last-stone-weight/ 0ms 100%

Leetcode: 1046. Last Stone Weight

func lastStoneWeight(stones []int) int {
	h := &IntHeap{}
	for _, val := range stones {
		heap.Push(h, val)
	}
	for h.Len() > 1 {
		var largest = heap.Pop(h).(int)
		var smaller = heap.Pop(h).(int)
		if largest != smaller {
			heap.Push(h, largest-smaller)
		}
	}
	if h.Len() > 0 {
		return heap.Pop(h).(int)
	}
	return 0
}

type IntHeap []int

func (h IntHeap) Len() int {
	return len(h)
}

func (h IntHeap) Less(i, j int) bool {
	return h[i] > h[j]
}

func (h IntHeap) Swap(i, j int) {
	h[i], h[j] = h[j], h[i]
}

func (h *IntHeap) Push(x interface{}) {
	*h = append(*h, x.(int))
}

func (h *IntHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0:n-1]
	return x
}