##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Two heaps in action
Design a data structure that supports:
addNum(num): add an integer from the streamfindMedian(): return the median of all elements so farYou're solving the classic two-heaps problem. It tests whether you can maintain the invariants correctly during insertion.