Method Pop

find_median_from_data_stream_295/solution.go:40–45

()

	*h = append(*h, x.(int))
}
func (h *MinHeap) Pop() interface{} {
	v := *h
	p := v[len(v)-1]
	*h = v[0 : len(v)-1]
	return p
}

type MedianFinder struct {
	// keep the smaller half of numbers in a max heap for O(1) access to middle