小根堆实现

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

type minHeap []*ListNode   func (h minHeap) Len() int           { return len(h) } func (h minHeap) Less(i, j int) bool { return h[i].Val < h[j].Val } func (h minHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] } func (h *minHeap) Push(x interface{}) {     *h = append(*h, x.(*ListNode)) } func (h *minHeap) Pop() interface{} {     old := *h     n := len(old)     x := old[n-1]     *h = old[0 : n-1]     return x }

　　例题，力扣23题：

 

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37

type minHeap []*ListNode   func (h minHeap) Len() int           { return len(h) } func (h minHeap) Less(i, j int) bool { return h[i].Val < h[j].Val } func (h minHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] } func (h *minHeap) Push(x interface{}) {     *h = append(*h, x.(*ListNode)) } func (h *minHeap) Pop() interface{} {     old := *h     n := len(old)     x := old[n-1]     *h = old[0 : n-1]     return x }   func mergeKLists(lists []*ListNode) *ListNode {     h := new(minHeap)     for i := 0; i < len(lists); i++ {         if lists[i] != nil {             heap.Push(h, lists[i])         }     }       dummyHead := new(ListNode)     pre := dummyHead     for h.Len() > 0 {         tmp := heap.Pop(h).(*ListNode)         if tmp.Next != nil {             heap.Push(h, tmp.Next)         }         pre.Next = tmp         pre = pre.Next     }       return dummyHead.Next }