-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathFindMedianFromDataStream.cpp
61 lines (54 loc) · 1.47 KB
/
FindMedianFromDataStream.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
typedef long long ll;
class MedianFinder {
public:
/** initialize your data structure here. */
priority_queue<ll>maxHeap;
priority_queue<ll,vector<ll>,greater<ll>>minHeap;
ll sizeMinHeap=0;
ll sizeMaxHeap=0;
MedianFinder() {
maxHeap={};
minHeap={};
sizeMinHeap=0;
sizeMaxHeap=0;
}
void balance(){
ll t;
if(sizeMaxHeap+2==sizeMinHeap){
t=minHeap.top();
minHeap.pop();
maxHeap.push(t);
sizeMaxHeap++;
sizeMinHeap--;
}
else if(sizeMinHeap+2==sizeMaxHeap){
t=maxHeap.top();
maxHeap.pop();
minHeap.push(t);
sizeMaxHeap--;
sizeMinHeap++;
}
}
void addNum(int num) {
if(sizeMaxHeap==0){
maxHeap.push(num);
sizeMaxHeap++;
}
else{
if(maxHeap.top()>=num){maxHeap.push(num);sizeMaxHeap++;}
else {minHeap.push(num);sizeMinHeap++; }
}
balance();
}
double findMedian() {
if(sizeMaxHeap==sizeMinHeap)return (double) (maxHeap.top()+minHeap.top())/2;
if(sizeMaxHeap>sizeMinHeap)return (double) maxHeap.top();
return (double) minHeap.top();
}
};
/**
* Your MedianFinder object will be instantiated and called as such:
* MedianFinder* obj = new MedianFinder();
* obj->addNum(num);
* double param_2 = obj->findMedian();
*/