class Solution {
public:
vector<int> nums;
void insert(int num){
nums.push_back(num);
}
double getMedian(){
int len = nums.size();
int mid = len / 2;
vector<int> tmp = nums;
sort(tmp.begin(), tmp.end());
if(len % 2 == 0) //偶数
return ((double)tmp[mid]+(double)tmp[mid-1]) / 2;//别让自动转化为整数了
else
return tmp[mid];
}
};
这样也可以??没用y总的大根堆小跟堆维护最大值和最小值,直接sort完事儿了??
+4
+3
+2
+1…