InsertDeleteGetrandomO1DuplicatesAllowed.cpp

// Source : https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/
// Author : Hao Chen
// Date   : 2016-08-25

/*************************************************************************************** 
 *
 * Design a data structure that supports all following operations in average O(1) time.
 * Note: Duplicate elements are allowed.
 * 
 * insert(val): Inserts an item val to the collection.
 * remove(val): Removes an item val from the collection if present.
 * 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();
 ***************************************************************************************/

class RandomizedCollection {
public:
    /** Initialize your data structure here. */
    RandomizedCollection() {
        srand(time(NULL));
    }
    
    /** 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);
        valpos[val].insert( data.size() - 1 );
        return (valpos[val].size() == 1);
    }
    
    /** Removes a value from the collection. Returns true if the collection contained the specified element. */
    bool remove(int val) {
        // not found
        if (!find(val)) return false;
        
        
        //same idea with non-duplication version, but need be careful with some edge case
        int _idx = *(valpos[val].begin());
        int _val = data.back();
        
        valpos[_val].insert(_idx);
        data[_idx] = _val;
        
        valpos[val].erase(_idx);
        if (valpos[val].size()==0){
            valpos.erase(val);
        }
        
        data.pop_back();
        if ( _idx < data.size() ){
            valpos[_val].erase(data.size());
            valpos[_val].insert(_idx);
        }
        
        return true;        
    }
    
    /** Get a random element from the collection. */
    int getRandom() {
        return data[ rand() % data.size() ];
    }
private:
    unordered_map<int, unordered_set<int>> valpos; //value position map
    vector<int> data;
    bool find(int val) {
        return (valpos.find(val) != valpos.end());
    }
   
};

/**
 * 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();
 */