中位数II

 1 #include<iostream>
 2 #include<vector>
 3 //#include<algorithm>
 4 #include<queue>
 5 using namespace std;
 6 class Solution {
 7 public:
 8     vector<int> medianII(vector<int>& nums)
 9     {
10         vector<int> result;
11         if (nums.size() == 0)
12             return result;
13         int median = nums[0];
14         priority_queue<int> max_heap, min_heap;
15         result.push_back(median);
16         for (int i = 1; i < nums.size(); ++i)//one by one
17         {
18             if (nums[i] < median)
19                 max_heap.push(nums[i]);
20             else
21                 min_heap.push(-nums[i]);
22             if (max_heap.size()>min_heap.size())
23             {
24                 min_heap.push(-median);
25                 median = max_heap.top();
26                 max_heap.pop();
27             }
28             else if (max_heap.size() + 1 < min_heap.size())
29             {
30                 max_heap.push(median);
31                 median = -min_heap.top();
32                 min_heap.pop();
33             }
34             result.push_back(median);
35         }
36         return result;
37     }
38 };
39 int main()
40 {
41     Solution test;
42     vector<int> val = {1,5,6,2,8};
43     vector<int> res = test.medianII(val);
44     for (auto x : res)
45         cout << x << " ";
46     return 0;
47 }