题解 | #数据流中的中位数#

#include <map>
#include <vector>
class Solution {
public:
    vector<int> nums;
    void Insert(int num) {
        if(nums.size()==0){
            nums.push_back(num);
            return;
        }
        auto it=nums.begin();
        while(it!=nums.end()&&(*it)<num) {
            it++;
        }
        nums.insert(it,1,num);
    }

    double GetMedian() { 
        double ans;
        if(nums.size()==0) return 0.00;
        if(nums.size()%2==1){
            ans=nums[nums.size()/2];
        }
        else{
            ans=(double(nums[nums.size()/2])+double(nums[nums.size()/2-1]))/2;
        }
        return ans;
    }

};