380. Insert Delete GetRandom O(1)

Posted on Edited on In

380. Insert Delete GetRandom O(1)

Description

Difficulty: Medium

Related Topics: Array, Hash Table, Math, Design, Randomized

Implement the RandomizedSet class:

  • RandomizedSet() Initializes the RandomizedSet object.
  • bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.
  • bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.
  • int getRandom() Returns a random element from the current set of elements (it’s guaranteed that at least one element exists when this method is called). Each element must have the same probability of being returned.

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

Example 1:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
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:

  • -231 <= val <= 231 - 1
  • At most 2 * 105 calls will be made to insert, remove, and getRandom.
  • There will be at least one element in the data structure when getRandom is called.

Hints/Notes

  • 2023/08/13
  • Use array for O(1) random access, map doesn’t have O(1) random access, it needs to advance n slots
  • Use a map from val to index to ensure O(1) addition/removal from the end of vector
  • Leetcode solution(checked)

Solution

Language: C++

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
class RandomizedSet {
public:
    vector<int> vals;
    unordered_map<int, int> valToIndex;

    RandomizedSet() {

    }

    bool insert(int val) {
        if (valToIndex.count(val)) {
            return false;
        }
        vals.push_back(val);
        valToIndex[val] = vals.size() - 1;
        return true;
    }

    bool remove(int val) {
        if (!valToIndex.count(val)) {
            return false;
        }
        int idx = valToIndex[val];
        int last = vals.back();
        // it's to remove the value from array in O(1)
        vals[idx] = last;
        valToIndex[last] = idx;
        vals.pop_back();
        valToIndex.erase(val);
        return true;
    }

    int getRandom() {
        return vals[rand() % vals.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();
 */