[LeetCode] Find Median from Data Stream
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
Examples:
[2,3,4]
, the median is 3
[2,3]
, the median is (2 + 3) / 2 = 2.5
Design a data structure that supports the following two operations:
- void addNum(int num) - Add a integer number from the data stream to the data structure.
- double findMedian() - Return the median of all elements so far.
For example:
add(1) add(2) findMedian() -> 1.5 add(3) findMedian() -> 2
1 class MedianFinder { 2 private: 3 multiset<int> left, right; 4 5 public: 6 7 // Adds a number into the data structure. 8 void addNum(int num) { 9 if (right.empty() || num < *right.begin()) left.insert(num); 10 else right.insert(num); 11 } 12 13 // Returns the median of current data stream 14 double findMedian() { 15 int size = left.size() + right.size(); 16 while (left.size() > size / 2) { 17 int tmp = *left.rbegin(); 18 right.insert(tmp); 19 left.erase(left.find(tmp)); 20 } 21 while (left.size() < size / 2) { 22 int tmp = *right.begin(); 23 left.insert(tmp); 24 right.erase(right.find(tmp)); 25 } 26 if (size & 1) return *right.begin(); 27 else return (double)(*left.rbegin() + *right.begin()) / 2; 28 } 29 }; 30 31 // Your MedianFinder object will be instantiated and called as such: 32 // MedianFinder mf; 33 // mf.addNum(1); 34 // mf.findMedian();
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步