一刷295

Author: diguage

README.adoc

@@ -2090,14 +2090,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0294-flip-game-ii.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/find-median-from-data-stream/[295. Find Median from Data Stream^]
-//|{source_base_url}/_0295_FindMedianFromDataStream.java[Java]
-//|{doc_base_url}/0295-find-median-from-data-stream.adoc[题解]
-//|Hard
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/find-median-from-data-stream/[295. Find Median from Data Stream^]
+|{source_base_url}/_0295_FindMedianFromDataStream.java[Java]
+|{doc_base_url}/0295-find-median-from-data-stream.adoc[题解]
+|Hard
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/best-meeting-point/[296. Best Meeting Point^]
 //|{source_base_url}/_0296_BestMeetingPoint.java[Java]

docs/0295-find-median-from-data-stream.adoc

@@ -38,12 +38,63 @@ findMedian() -> 2
 * If all integer numbers from the stream are between 0 and 100, how would you optimize it?
 * If 99% of all integer numbers from the stream are between 0 and 100, how would you optimize it?
 
+== 思路分析
 
+image::images/0295-01.png[{image_attr}]
+
+image::images/0295-02.png[{image_attr}]
+
+image::images/0295-03.png[{image_attr}]
+
+image::images/0295-04.png[{image_attr}]
+
+image::images/0295-05.png[{image_attr}]
+
+image::images/0295-06.png[{image_attr}]
+
+image::images/0295-07.png[{image_attr}]
+
+image::images/0295-08.png[{image_attr}]
+
+image::images/0295-09.png[{image_attr}]
+
+image::images/0295-10.png[{image_attr}]
+
+image::images/0295-11.png[{image_attr}]
+
+image::images/0295-12.png[{image_attr}]
+
+image::images/0295-13.png[{image_attr}]
+
+image::images/0295-14.png[{image_attr}]
 
 
 [[src-0295]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0295_FindMedianFromDataStream.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0005_LongestPalindromicSubstring_2.java[tag=answer]
+// ----
+// --
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/find-median-from-data-stream/solutions/961062/shu-ju-liu-de-zhong-wei-shu-by-leetcode-ktkst/[295. 数据流的中位数 - 官方题解^]
+. https://leetcode.cn/problems/find-median-from-data-stream/solutions/2361972/295-shu-ju-liu-de-zhong-wei-shu-dui-qing-gmdo/[295. 数据流的中位数 - 堆，清晰图解^]
+
+
 

docs/images/0295-01.png

@@ -664,7 +664,7 @@ include::0289-game-of-life.adoc[leveloffset=+1]
 
 // include::0294-flip-game-ii.adoc[leveloffset=+1]
 
-// include::0295-find-median-from-data-stream.adoc[leveloffset=+1]
+include::0295-find-median-from-data-stream.adoc[leveloffset=+1]
 
 // include::0296-best-meeting-point.adoc[leveloffset=+1]
 

docs/images/0295-02.png

@@ -424,6 +424,11 @@
 |{doc_base_url}/0268-missing-number.adoc[题解]
 |循环排序
 
+|{counter:codes}
+|{leetcode_base_url}/find-median-from-data-stream/[295. Find Median from Data Stream^]
+|{doc_base_url}/0295-find-median-from-data-stream.adoc[题解]
+|双堆思路太妙了！
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

docs/images/0295-03.png

@@ -0,0 +1,40 @@
+package com.diguage.algo.leetcode;
+
+import java.util.PriorityQueue;
+import java.util.Queue;
+
+public class _0295_FindMedianFromDataStream {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-08-29 20:43:20
+   */
+  class MedianFinder {
+    Queue<Integer> big;
+    Queue<Integer> small;
+
+    public MedianFinder() {
+      // 小顶堆，顶部是最小的。保存较大的一半
+      big = new PriorityQueue<>();
+      // 大顶堆，顶部是最大的。保存较小的一半
+      small = new PriorityQueue<>((a, b) -> b - a);
+    }
+
+    public void addNum(int num) {
+      if (big.size() != small.size()) {
+        // 倒腾一下，实际 small 中的元素增加了
+        big.add(num);
+        small.add(big.poll());
+      } else {
+        // 倒腾一下，实际 big 中的元素增加了
+        small.add(num);
+        big.add(small.poll());
+      }
+    }
+
+    public double findMedian() {
+      return big.size() != small.size() ? big.peek() : (big.peek() + small.peek()) / 2.0;
+    }
+  }
+  // end::answer[]
+}