go简单实现heap

go 简单实现heap

go有一个线程的heap接口 实现简单的方法即可实现heap container/heap/heap/Interface

type Interface interface {
	sort.Interface
	Push(x interface{}) // add x as element Len()
	Pop() interface{}   // remove and return element Len() - 1.
}

只需要简单实现接口即可

type Heap struct {
	slice []int
	nums  int
}

func (h *Heap) Len() int {
	return h.nums
}

func (h *Heap) Less(i, j int) bool {
	return (h.slice)[i] > (h.slice)[j]
}

func (h *Heap) Swap(i, j int) {
	(h.slice)[i], (h.slice)[j] = (h.slice)[j], (h.slice)[i]
}

func (h *Heap) Push(x interface{}) {
	h.nums++
	h.slice = append(h.slice, x.(int))
}

func (h *Heap) Pop() (ret interface{}) {
	ret = (h.slice)[h.Len()-1]
	h.slice = (h.slice)[:h.Len()-1]
	h.nums--
	return
}



func main()  {
	ret := &Heap{
		slice:   []int{},
	}
	heap.Init(ret)
	heap.Push(ret,1)
	heap.Pop(ret)
	fmt.Println(ret)
}