添加堆排序

Author: hero

README.md

@@ -9,6 +9,10 @@
      
 ###  leet_code  [leet_code刷题]
      1: leet_code刷题
+     
+###  heap  [堆]
+     1: max_heap_test 大顶推   
+     2: min_heap_test 小顶堆     
 
 ###  linked_list  [链表]
      1: cycle_list  循环链表

heap/max_heap_test.go

@@ -0,0 +1,44 @@
+package heap
+
+import (
+	"container/heap"
+	"fmt"
+	"testing"
+)
+
+type MaxHeap []int
+
+func (m MaxHeap) Len() int {
+	return len(m)
+}
+
+func (m MaxHeap) Less(i, j int) bool {
+	return m[i] > m[j]
+}
+
+func (m MaxHeap) Swap(i, j int) {
+	m[i], m[j] = m[j], m[i]
+}
+
+func (m *MaxHeap) Push(x interface{}) {
+	*m = append(*m, x.(int))
+}
+
+func (m *MaxHeap) Pop() interface{} {
+	old := *m
+	n := len(old)
+	x := old[n-1]
+	*m = old[0 : n-1]
+	return x
+}
+
+func TestMaxHeap(t *testing.T) {
+	m := &MaxHeap{
+		2, 10, 5, 9, 12, 7, 3,
+	}
+	heap.Init(m)
+	for m.Len() > 0 {
+		fmt.Printf("%d ", heap.Pop(m))
+	}
+
+}

heap/min_heap_test.go

@@ -0,0 +1,44 @@
+package heap
+
+import (
+	"container/heap"
+	"fmt"
+	"testing"
+)
+
+type MinHeap []int
+
+func (m MinHeap) Len() int {
+	return len(m)
+}
+
+func (m MinHeap) Less(i, j int) bool {
+	return m[i] < m[j]
+}
+
+func (m MinHeap) Swap(i, j int) {
+	m[i], m[j] = m[j], m[i]
+}
+
+func (m *MinHeap) Push(x interface{}) {
+	*m = append(*m, x.(int))
+}
+
+func (m *MinHeap) Pop() interface{} {
+	old := *m
+	n := len(old)
+	x := old[n-1]
+	*m = old[0 : n-1]
+	return x
+}
+
+func TestMinHeap(t *testing.T) {
+	m := &MinHeap{
+		2, 10, 5, 9, 12, 7, 3,
+	}
+	heap.Init(m)
+	for m.Len() > 0 {
+		fmt.Printf("%d ", heap.Pop(m))
+	}
+
+}