← All problems

380. Insert Delete Getrandom O1

MediumOpen on LeetCodeProblem statement

Problem Statement

380. Insert Delete GetRandom O(1)

Medium


Implement the RandomizedSet class:

You must implement the functions of the class such that each function works in average O(1) time complexity.

 

Example 1:

Input
["RandomizedSet", "insert", "remove", "insert", "getRandom", "remove", "insert", "getRandom"]
[[], [1], [2], [2], [], [1], [2], []]
Output
[null, true, false, true, 2, true, false, 2]

Explanation
RandomizedSet randomizedSet = new RandomizedSet();
randomizedSet.insert(1); // Inserts 1 to the set. Returns true as 1 was inserted successfully.
randomizedSet.remove(2); // Returns false as 2 does not exist in the set.
randomizedSet.insert(2); // Inserts 2 to the set, returns true. Set now contains [1,2].
randomizedSet.getRandom(); // getRandom() should return either 1 or 2 randomly.
randomizedSet.remove(1); // Removes 1 from the set, returns true. Set now contains [2].
randomizedSet.insert(2); // 2 was already in the set, so return false.
randomizedSet.getRandom(); // Since 2 is the only number in the set, getRandom() will always return 2.

 

Constraints:

C++

Source file
class RandomizedSet {
public:
    unordered_set <int> s;
    vector<int> v;
    
    bool insert(int val) {
        if (s.find(val)!=s.end())   // found
            return false;
        s.insert(val);
        v.push_back(val);
        return true;
    }
    
    bool remove(int val) {
        auto it = s.find(val);
        if (it==s.end())   // not found
            return false;
        s.erase(it);
        auto it2 = find(v.begin(), v.end(), val);
        v.erase(it2);
        return true;
    }
    
    int getRandom() {
        return v[rand()%v.size()];
    }
};

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