堆
type $STRUCT$ struct{<br> weight int<br> $FIELDS$<br>}<br>type compare func(a, b interface{}) bool<br>type heapHandler struct{<br> arr []*$STRUCT$<br> cmp compare<br>}<br>func (h heapHandler) Len() int {return len(h.arr)}<br>func (h heapHandler) Swap(i, j int) { h.arr[i], h.arr[j] = h.arr[j], h.arr[i]}<br>func (h *heapHandler) Push(x interface{}) { h.arr = append(h.arr, x.(*$STRUCT$))}<br>func (h heapHandler) Less(i, j int) bool {return h.cmp(h.arr[i], h.arr[j])}<br>func (h *heapHandler) Pop() interface{} {<br> old := h.arr<br> n := h.Len()<br> x := old[n-1]<br> h.arr = old[:n-1]<br> return x<br>}<br>type MyHeap struct{h *heapHandler}<br>func NewMyHeap(arr []*$STRUCT$, cmp compare) *MyHeap {<br> res := &MyHeap{&heapHandler{cmp: cmp}}<br> if len(arr) == 0 {return res}<br> res.h.arr = arr<br> heap.Init(res.h)<br> return res<br>}<br>func (m *MyHeap) Push(x interface{}) {heap.Push(m.h, x)}<br>func (m *MyHeap) Peek() interface{} {return m.h.arr[0]}<br>func (m *MyHeap) Pop() interface{} {return heap.Pop(m.h)}<br>func (m *MyHeap) Len() int {return m.h.Len()}
