leetcode 381. Insert Delete GetRandom O(1) - Duplicates allowed

Design a data structure that supports all following operations in average O(1) time.

Note: Duplicate elements are allowed.

 

1. insert(val): Inserts an item val to the collection.
2. remove(val): Removes an item val from the collection if present.
3. getRandom: Returns a random element from current collection of elements. The probability of each element being returned is linearly related to the number of same value the collection contains.

 

Example:

// Init an empty collection.
RandomizedCollection collection = new RandomizedCollection();

// Inserts 1 to the collection. Returns true as the collection did not contain 1.
collection.insert(1);

// Inserts another 1 to the collection. Returns false as the collection contained 1. Collection now contains [1,1].
collection.insert(1);

// Inserts 2 to the collection, returns true. Collection now contains [1,1,2].
collection.insert(2);

// getRandom should return 1 with the probability 2/3, and returns 2 with the probability 1/3.
collection.getRandom();

// Removes 1 from the collection, returns true. Collection now contains [1,2].
collection.remove(1);

// getRandom should return 1 and 2 both equally likely.
collection.getRandom();

解题思路：

因为关联数据结构的插入和删除时间复杂度都是O(1)，但是无法根据下标访问，而向量可以根据下标访问，而向量不能在O(1)时间内插入或者删除的原因之一是不知道该元素处于向量中哪个位置，所以可以将用向量存储元素，用一个unordered_map<int  , unordered_set<int>>存储元素在向量中的秩。

插入：

     bool insert(int val) 
    {
        data.push_back(val) ;
        hash[val].insert(data.size() - 1) ;
        
        cout<<val<<" size is "<<hash[val].size()<<endl;
        return hash[val].size() == 1 ;
    }

删除：这里删除有一个小技巧，使得删除可以在O(1)时间内完成。将元素和向量末元素互换，然后删掉向量末元素。这就可以在O(1)时间内删除。这里涉及到了被删元素秩的删除以及向量末元素相应秩的删除和增加。因为unordered_map（set）不存在重复元素，所以要注意插入的元素是否集合中已经存在。为了避免出现这个问题，要先删掉hash[val].erase(index) ;

class RandomizedCollection {
public:
    /** Initialize your data structure here. */
    RandomizedCollection() {
        
    }
    
    /** Inserts a value to the collection. Returns true if the collection did not already contain the specified element. */
    bool insert(int val) 
    {
        data.push_back(val) ;
        hash[val].insert(data.size() - 1) ;
        
        cout<<val<<" size is "<<hash[val].size()<<endl;
        return hash[val].size() == 1 ;
    }
    
    /** Removes a value from the collection. Returns true if the collection contained the specified element. */
    bool remove(int val) 
    {
        if(hash.count(val) == 0 ) return false ;
        auto itb = hash[val].begin() ;
        int index = *itb ;
        hash[val].erase(index) ;
        if(index < data.size() - 1)
        {
            int last = data.back() ;
            data[index] = last ;
            hash[last].erase(data.size() - 1) ;
            hash[last].insert(index) ;
        }
        data.pop_back() ;
        
        cout<<val<<" size(after) is "<<hash[val].size()<<endl;
        if(hash[val].empty()) hash.erase(val) ;
        
        return true ;
    }
    
    /** Get a random element from the collection. */
    int getRandom() 
    {
        return data[rand() % data.size()] ;
    }
    
private:
    
    vector<int> data ;
    unordered_map<int ,unordered_set<int>> hash ;

};

/**
 * Your RandomizedCollection object will be instantiated and called as such:
 * RandomizedCollection* obj = new RandomizedCollection();
 * bool param_1 = obj->insert(val);
 * bool param_2 = obj->remove(val);
 * int param_3 = obj->getRandom();
 */