add 295 java, update progress

yennanliu · Mar 11, 2024 · 5cd622b · 5cd622b
1 parent 8b125b4
commit 5cd622b
Show file tree

Hide file tree

Showing 4 changed files with 36 additions and 11 deletions.
diff --git a/README.md b/README.md
@@ -523,7 +523,7 @@
 378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | [Python](./leetcode_python/Heap/kth-smallest-element-in-a-sorted-matrix.py)  | _O(k * log(min(n, m, k)))_ | _O(min(n, m, k))_ | Medium | LintCode | AGAIN (not start)
 846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights/) | [Python](./leetcode_python/Heap/hand-of-straights.py) | _O(nlogn)_ | _O(n)_ | Medium |LC 1296, google, hashmap| OK*
 855 | [Exam Room](https://leetcode.com/problems/exam-room/) | [Python](./leetcode_python/Heap/exam-room.py)  | seat: _O(logn)_ <br> leave: _O(logn)_ | _O(n)_ | Medium | BST, Hash, `trick` | AGAIN* (2) (not start)
-295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [Python](./leetcode_python/Heap/find_median_from_data_stream.py)  | | | Hard |Curated Top 75, priority queue, trick ,heap, stream, `amazon`|  AGAIN****** (6)
+295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [Python](./leetcode_python/Heap/find_median_from_data_stream.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/Heap/FindMedianFromDataStream.java)  | | | Hard |Curated Top 75, priority queue, trick ,heap, stream, `amazon`|  AGAIN****** (6)
 703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | [Python](./leetcode_python/Heap/kth_largest_element_in_a_stream.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/Heap/KthLargestElementInAStream.java)  | | | Easy |heap, priority queue, `amazon`|  AGAIN***** (4)
 1046| [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) |  [Python](./leetcode_python/Heap/last-stone-weight.py), [Java](./leetcode_java/src/main/java/LeetCodeJava/Heap/LastStoneWeight.java)||| Easy |Heap, Priority Queue| OK
 1130| [Minimum Cost Tree From Leaf Values](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/)|[Python](./leetcode_python/Heap/minimum-cost-tree-from-leaf-values.py) | | | Medium | LC 1167,heap| not start

diff --git a/data/progress.txt b/data/progress.txt
@@ -1,4 +1,4 @@
-20240311: 261(again!!!),268,269(again),271
+20240311: 261(again!!!),268,269(again),271,295(again)
 20240310: 213,217,226,230,235,238,242,252,253
 20240309: 207(again!!!),208,211(again),212
 20240308: 152,153(again),190,191,198,200,206(again)

diff --git a/data/to_review.txt b/data/to_review.txt
@@ -1,4 +1,4 @@
-2024-05-05 -> ['261(again!!!),268,269(again),271']
+2024-05-05 -> ['261(again!!!),268,269(again),271,295(again)']
 2024-05-04 -> ['213,217,226,230,235,238,242,252,253']
 2024-05-03 -> ['207(again!!!),208,211(again),212']
 2024-05-02 -> ['152,153(again),190,191,198,200,206(again)']
@@ -10,7 +10,7 @@
 2024-04-24 -> ['39,48(again),49,53,54']
 2024-04-23 -> ['20,21,23,33(again)']
 2024-04-22 -> ['1,3,5,4,19']
-2024-04-14 -> ['261(again!!!),268,269(again),271']
+2024-04-14 -> ['261(again!!!),268,269(again),271,295(again)']
 2024-04-13 -> ['213,217,226,230,235,238,242,252,253']
 2024-04-12 -> ['207(again!!!),208,211(again),212']
 2024-04-11 -> ['152,153(again),190,191,198,200,206(again)']
@@ -21,27 +21,27 @@
 2024-04-06 -> ['55(again),56,62,70']
 2024-04-03 -> ['39,48(again),49,53,54']
 2024-04-02 -> ['20,21,23,33(again)']
-2024-04-01 -> ['261(again!!!),268,269(again),271', '1,3,5,4,19']
+2024-04-01 -> ['261(again!!!),268,269(again),271,295(again)', '1,3,5,4,19']
 2024-03-31 -> ['213,217,226,230,235,238,242,252,253']
 2024-03-30 -> ['207(again!!!),208,211(again),212']
 2024-03-29 -> ['152,153(again),190,191,198,200,206(again)']
 2024-03-28 -> ['139(again),141,143(again)']
 2024-03-27 -> ['121,124(again),125,128,133(again)']
 2024-03-26 -> ['100,102,104,105(again)']
 2024-03-25 -> ['73,76,79(again),91,25']
-2024-03-24 -> ['261(again!!!),268,269(again),271', '55(again),56,62,70']
+2024-03-24 -> ['261(again!!!),268,269(again),271,295(again)', '55(again),56,62,70']
 2024-03-23 -> ['213,217,226,230,235,238,242,252,253']
 2024-03-22 -> ['207(again!!!),208,211(again),212']
 2024-03-21 -> ['152,153(again),190,191,198,200,206(again)', '39,48(again),49,53,54']
 2024-03-20 -> ['139(again),141,143(again)', '20,21,23,33(again)']
-2024-03-19 -> ['261(again!!!),268,269(again),271', '121,124(again),125,128,133(again)', '1,3,5,4,19']
+2024-03-19 -> ['261(again!!!),268,269(again),271,295(again)', '121,124(again),125,128,133(again)', '1,3,5,4,19']
 2024-03-18 -> ['213,217,226,230,235,238,242,252,253', '100,102,104,105(again)']
 2024-03-17 -> ['207(again!!!),208,211(again),212', '73,76,79(again),91,25']
-2024-03-16 -> ['261(again!!!),268,269(again),271', '152,153(again),190,191,198,200,206(again)', '55(again),56,62,70']
+2024-03-16 -> ['261(again!!!),268,269(again),271,295(again)', '152,153(again),190,191,198,200,206(again)', '55(again),56,62,70']
 2024-03-15 -> ['213,217,226,230,235,238,242,252,253', '139(again),141,143(again)']
-2024-03-14 -> ['261(again!!!),268,269(again),271', '207(again!!!),208,211(again),212', '121,124(again),125,128,133(again)']
-2024-03-13 -> ['261(again!!!),268,269(again),271', '213,217,226,230,235,238,242,252,253', '152,153(again),190,191,198,200,206(again)', '100,102,104,105(again)', '39,48(again),49,53,54']
-2024-03-12 -> ['261(again!!!),268,269(again),271', '213,217,226,230,235,238,242,252,253', '207(again!!!),208,211(again),212', '139(again),141,143(again)', '73,76,79(again),91,25', '20,21,23,33(again)']
+2024-03-14 -> ['261(again!!!),268,269(again),271,295(again)', '207(again!!!),208,211(again),212', '121,124(again),125,128,133(again)']
+2024-03-13 -> ['261(again!!!),268,269(again),271,295(again)', '213,217,226,230,235,238,242,252,253', '152,153(again),190,191,198,200,206(again)', '100,102,104,105(again)', '39,48(again),49,53,54']
+2024-03-12 -> ['261(again!!!),268,269(again),271,295(again)', '213,217,226,230,235,238,242,252,253', '207(again!!!),208,211(again),212', '139(again),141,143(again)', '73,76,79(again),91,25', '20,21,23,33(again)']
 2024-03-11 -> ['213,217,226,230,235,238,242,252,253', '207(again!!!),208,211(again),212', '152,153(again),190,191,198,200,206(again)', '121,124(again),125,128,133(again)', '55(again),56,62,70', '1,3,5,4,19']
 2024-03-10 -> ['207(again!!!),208,211(again),212', '152,153(again),190,191,198,200,206(again)', '139(again),141,143(again)', '100,102,104,105(again)']
 2024-03-09 -> ['152,153(again),190,191,198,200,206(again)', '139(again),141,143(again)', '121,124(again),125,128,133(again)', '73,76,79(again),91,25']

diff --git a/leetcode_java/src/main/java/LeetCodeJava/Heap/FindMedianFromDataStream.java b/leetcode_java/src/main/java/LeetCodeJava/Heap/FindMedianFromDataStream.java
@@ -0,0 +1,25 @@
+package LeetCodeJava.Heap;
+
+// https://leetcode.com/problems/find-median-from-data-stream/?envType=list&envId=xoqag3yj
+
+public class FindMedianFromDataStream {
+
+    // V0
+    // TODO : implement
+    class MedianFinder {
+
+        public MedianFinder() {
+
+        }
+
+        public void addNum(int num) {
+
+        }
+
+        public double findMedian() {
+            return 0.0;
+        }
+    }
+
+
+}