[leetcode] 295. Find Median from Data Stream

• https://leetcode.com/problems/find-median-from-data-stream/solution/

class MedianFinder {    priority_queue<int> lo;                              // max heap    priority_queue<int, vector<int>, greater<int>> hi;   // min heappublic:    // Adds a number into the data structure.    void addNum(int num)    {        lo.push(num);                                    // Add to max heap        hi.push(lo.top());                               // balancing step        lo.pop();        if (lo.size() < hi.size()) {                     // maintain size property            lo.push(hi.top());            hi.pop();        }    }    // Returns the median of current data stream    double findMedian()    {        return lo.size() > hi.size() ? (double) lo.top() : (lo.top() + hi.top()) * 0.5;    }};