Скачать или смотреть Find Median from Data Stream | Heap | LEETCODE 295 | Geeksforgeeks

Thank you for watching the video! I hope you enjoyed it. If you have any questions or feedback, please feel free to share them in the comments section below.

Don’t forget to subscribe if you find the videos helpful. Your support means a lot. Thanks! 😊

For any kind of help DM me on LinkedIn:
Connect with me on LinkedIn:   / kkvinokk  

Special thanks to @Jenny's Lectures CS IT -    • 7.9 Heap Sort | Heapify Method | Build Max...  

Solution Tracing for Find Median from Data Stream

The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values.

For example, for arr = [2,3,4], the median is 3.
For example, for arr = [2,3], the median is (2 + 3) / 2 = 2.5.
Implement the MedianFinder class:

MedianFinder() initializes the MedianFinder object.
void addNum(int num) adds the integer num from the data stream to the data structure.
double findMedian() returns the median of all elements so far. Answers within 10-5 of the actual answer will be accepted.


Example 1:

Input
["MedianFinder", "addNum", "addNum", "findMedian", "addNum", "findMedian"]
[[], [1], [2], [], [3], []]
Output
[null, null, null, 1.5, null, 2.0]

Explanation
MedianFinder medianFinder = new MedianFinder();
medianFinder.addNum(1); // arr = [1]
medianFinder.addNum(2); // arr = [1, 2]
medianFinder.findMedian(); // return 1.5 (i.e., (1 + 2) / 2)
medianFinder.addNum(3); // arr[1, 2, 3]
medianFinder.findMedian(); // return 2.0