Method Less

top_k_frequent_elements_347/solution.go:15–17

(i, j int)

	return len(h)
}
func (h freqHeap) Less(i, j int) bool {
	return h[i].val > h[j].val
}
func (h freqHeap) Swap(i, j int) {
	h[i], h[j] = h[j], h[i]
}