Find Median solution

Author: PDKhan

find-median-from-data-stream/PDKhan.cpp

@@ -0,0 +1,31 @@
+class MedianFinder {
+    priority_queue<int> maxHeap;
+    priority_queue<int, vector<int>, greater<int>> minHeap;
+public:
+    MedianFinder() {   
+    }
+    
+    void addNum(int num) {
+        if(maxHeap.empty() || num <= maxHeap.top())
+            maxHeap.push(num);
+        else
+            minHeap.push(num);
+
+        if(maxHeap.size() > minHeap.size() + 1){
+            minHeap.push(maxHeap.top());
+            maxHeap.pop();
+        }else if(maxHeap.size() < minHeap.size()){
+            maxHeap.push(minHeap.top());
+            minHeap.pop();
+        }
+    }
+    
+    double findMedian() {
+        if(maxHeap.size() > minHeap.size())
+            return maxHeap.top();
+        else if(maxHeap.size() < minHeap.size())
+            return minHeap.top();
+        else
+            return (maxHeap.top() + minHeap.top()) / 2.0;
+    }
+};