-
Notifications
You must be signed in to change notification settings - Fork 0
/
findMedian.cpp
85 lines (77 loc) · 1.75 KB
/
findMedian.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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <bits/stdc++.h>
using namespace std;
//* Expected Time Complexity: O(NLogN)
int signum(int a, int b)
{
if (a == b)
return 0;
else if (a > b)
return 1;
else
return -1;
}
void getMedian(int element, priority_queue<int> &maxi, priority_queue<int, vector<int>, greater<int>> &mini, int &median)
{
switch (signum(maxi.size(), mini.size()))
{
case 0:
if (element > median)
{
mini.push(element);
median = mini.top();
}
else
{
maxi.push(element);
median = maxi.top();
}
break;
case 1:
if (element > median)
{
mini.push(element);
}
else
{
mini.push(maxi.top());
maxi.pop();
maxi.push(element);
}
median = (maxi.top() + mini.top()) / 2;
break;
case -1:
if (element > median)
{
maxi.push(mini.top());
mini.pop();
mini.push(element);
}
else
{
maxi.push(element);
}
median = (mini.top() + maxi.top()) / 2;
break;
}
}
vector<int> findMedian(vector<int> &arr, int n)
{
vector<int> ans;
priority_queue<int> maxHeap;
priority_queue<int, vector<int>, greater<int>> minHeap;
int median = 0;
for (int i = 0; i < n; i++)
{
getMedian(arr[i], maxHeap, minHeap, median);
ans.push_back(median);
}
return ans;
}
int main()
{
vector<int> arr = {5, 3, 8};
vector<int> ans = findMedian(arr, arr.size());
for (auto i : ans)
cout << i << " ";
cout << endl;
}