feat: add cpp solution to lc problem: No.0295.Find Median from Data Stream

Author: maolonglong

solution/0200-0299/0295.Find Median from Data Stream/README.md

@@ -26,7 +26,7 @@
 <pre>addNum(1)
 addNum(2)
 findMedian() -&gt; 1.5
-addNum(3) 
+addNum(3)
 findMedian() -&gt; 2</pre>
 
 <p><strong>进阶:</strong></p>
@@ -117,6 +117,44 @@ class MedianFinder {
  */
 ```
 
+### **C++**
+
+```cpp
+class MedianFinder {
+public:
+    /** initialize your data structure here. */
+    MedianFinder() {}
+
+    void addNum(int num) {
+        max_heap.push(num);
+        min_heap.push(max_heap.top());
+        max_heap.pop();
+        if (min_heap.size() > max_heap.size()) {
+            max_heap.push(min_heap.top());
+            min_heap.pop();
+        }
+    }
+
+    double findMedian() {
+        if (max_heap.size() > min_heap.size()) {
+            return max_heap.top();
+        }
+        return (double)(max_heap.top() + min_heap.top()) / 2;
+    }
+
+private:
+    priority_queue<int> max_heap;
+    priority_queue<int, vector<int>, greater<int>> min_heap;
+};
+
+/**
+ * Your MedianFinder object will be instantiated and called as such:
+ * MedianFinder* obj = new MedianFinder();
+ * obj->addNum(num);
+ * double param_2 = obj->findMedian();
+ */
+```
+
 ### **...**
 
 ```

solution/0200-0299/0295.Find Median from Data Stream/README_EN.md

@@ -126,6 +126,44 @@ class MedianFinder {
  */
 ```
 
+### **Go**
+
+```cpp
+class MedianFinder {
+public:
+    /** initialize your data structure here. */
+    MedianFinder() {}
+
+    void addNum(int num) {
+        max_heap.push(num);
+        min_heap.push(max_heap.top());
+        max_heap.pop();
+        if (min_heap.size() > max_heap.size()) {
+            max_heap.push(min_heap.top());
+            min_heap.pop();
+        }
+    }
+
+    double findMedian() {
+        if (max_heap.size() > min_heap.size()) {
+            return max_heap.top();
+        }
+        return (double)(max_heap.top() + min_heap.top()) / 2;
+    }
+
+private:
+    priority_queue<int> max_heap;
+    priority_queue<int, vector<int>, greater<int>> min_heap;
+};
+
+/**
+ * Your MedianFinder object will be instantiated and called as such:
+ * MedianFinder* obj = new MedianFinder();
+ * obj->addNum(num);
+ * double param_2 = obj->findMedian();
+ */
+```
+
 ### **...**
 
 ```

solution/0200-0299/0295.Find Median from Data Stream/Solution.cpp

@@ -0,0 +1,33 @@
+class MedianFinder {
+public:
+    /** initialize your data structure here. */
+    MedianFinder() {}
+
+    void addNum(int num) {
+        max_heap.push(num);
+        min_heap.push(max_heap.top());
+        max_heap.pop();
+        if (min_heap.size() > max_heap.size()) {
+            max_heap.push(min_heap.top());
+            min_heap.pop();
+        }
+    }
+
+    double findMedian() {
+        if (max_heap.size() > min_heap.size()) {
+            return max_heap.top();
+        }
+        return (double)(max_heap.top() + min_heap.top()) / 2;
+    }
+
+private:
+    priority_queue<int> max_heap;
+    priority_queue<int, vector<int>, greater<int>> min_heap;
+};
+
+/**
+ * Your MedianFinder object will be instantiated and called as such:
+ * MedianFinder* obj = new MedianFinder();
+ * obj->addNum(num);
+ * double param_2 = obj->findMedian();
+ */