[Leetcode] Problem 380 - Insert Delete GetRandom O(1)

Posted on | In ,

Implement the RandomizedSet class:

  • 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.

Follow up

Could you implement the functions of the class with each function works in average O(1) time?

Example

Input
[“RandomizedSet”, “insert”, “remove”, “insert”, “getRandom”, “remove”, “insert”, “getRandom”]
[[], [1], [2], [2], [], [1], [2], []]

Output
[null, true, false, true, 2, true, false, 2]

Explanation

1
2
3
4
5
6
7
8
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

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

Code

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
private Random random;
private Map<Integer, Integer> map;
private ArrayList<Integer> vals;

public RandomizedSet() {
    random = new Random();
    map = new HashMap<>();
    vals = new ArrayList<>();
}

public boolean insert(int val) {
    if (map.containsKey(val))
        return false;

    vals.add(val);
    map.put(val, vals.size() - 1);
    return true;
}

public boolean remove(int val) {
    if (!map.containsKey(val))
        return false;

    int idx = map.get(val);

    if (idx != vals.size() - 1) {
        int lastVal = vals.get(vals.size() - 1);
        vals.set(idx, lastVal);
        map.put(lastVal, idx);
    }

    vals.remove(vals.size() - 1);
    map.remove(val);
    return true;
}

public int getRandom() {
    int idx = random.nextInt(vals.size());
    return vals.get(idx);
}