数字是不断进入数组的,在每次添加一个新的数进入数组的同时返回当前新数组的中位数。
说明
中位数的定义:
- 中位数是排序后数组的中间值,如果有数组中有n个数,则中位数为A[(n-1)/2]。
- 比如:数组A=[1,2,3]的中位数是2,数组A=[1,19]的中位数是1。
样例
持续进入数组的数的列表为:[1, 2, 3, 4, 5],则返回[1, 1, 2, 2, 3]
持续进入数组的数的列表为:[4, 5, 1, 3, 2, 6, 0],则返回 [4, 4, 4, 3, 3, 3, 3]
持续进入数组的数的列表为:[2, 20, 100],则返回[2, 2, 20]
挑战
时间复杂度为O(nlogn)
点题:非常有技巧,同类型的题应该都是这样解
class Solution {
public:
/*
* @param nums: A list of integers
* @return: the median of numbers
*/
vector<int> medianII(vector<int> &nums) {
// write your code here
vector<int> res;
if (nums.size() == 0) {
return res;
}
priority_queue<int> max_heap;
priority_queue<int> min_heap;
for (int i = 0; i < nums.size(); i++) {
max_heap.push(nums[i]);
min_heap.push(0 - max_heap.top());
max_heap.pop();
if (max_heap.size() < min_heap.size()) {
max_heap.push(0 - min_heap.top());
min_heap.pop();
}
res.push_back(max_heap.top());
}
return res;
}
};
better use == priority_queue<int, vector<int>, greater<int>>
default it priority_queue<int, vector<int>, less<int>>
class Solution {
public:
/**
* @param nums: A list of integers
* @return: the median of numbers
*/
vector<int> medianII(vector<int> &nums) {
// write your code here
vector<int> res;
priority_queue<int> bigheap;
priority_queue<int, vector<int>, greater<int>> littleheap;
for (int i = 0; i < nums.size(); i++) {
bigheap.push(nums[i]);
// push littleheap
littleheap.push(bigheap.top());
bigheap.pop();
// ensure bigheap is >= than littleheap
if (littleheap.size() > bigheap.size()) {
bigheap.push(littleheap.top());
littleheap.pop();
}
res.push_back(bigheap.top());
}
return res;
}
};