leetcode 715. Range 模块 (hard)

class RangeModule {
private:
    map<int,int> mp;
public:
    RangeModule() {
    }
    
    void addRange(int left, int right) {
        int l = left, r = right;
        auto p = mp.lower_bound(left);
        while(p != mp.end() && p -> second <= right)
        {
            l = min(l,p->second);
            r = max(r,p->first);
              auto temp = p;
              p++;
              mp.erase(temp->first);
        
        }
        mp[r] = l;
    }
    
    bool queryRange(int left, int right) {
        auto p = mp.lower_bound(left);
        if(p == mp.end())
        return false;
        if(p -> second <= left && p -> first >= right)
        return true;
        return false;
    }
    
    void removeRange(int left, int right) {
        auto p = mp.lower_bound(left + 1);
        while(p != mp.end() && p -> second <= right)
        {
            if(p -> second < left){
                mp[left] = p -> second;
            }
            if(p -> first > right){
                mp[p->first] = right;
                break;
            }
            else {
              auto temp = p;
              p++;
              mp.erase(temp->first);
            }
        }
    }
};

/**
 * Your RangeModule object will be instantiated and called as such:
 * RangeModule* obj = new RangeModule();
 * obj->addRange(left,right);
 * bool param_2 = obj->queryRange(left,right);
 * obj->removeRange(left,right);
 */