-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRandomizedSet.java
More file actions
57 lines (45 loc) · 1.74 KB
/
RandomizedSet.java
File metadata and controls
57 lines (45 loc) · 1.74 KB
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
45
46
47
48
49
50
51
52
53
54
55
56
57
class RandomizedSet {
private Map<Integer, Integer> valuesIndexes;
private List<Integer> values;
private Random rand;
/** Initialize your data structure here. */
public RandomizedSet() {
valuesIndexes = new HashMap<>();
values = new ArrayList<>();
rand = new Random();
}
/** Inserts a value to the set. Returns true if the set did not already contain the specified element. */
public boolean insert(int val) {
if (valuesIndexes.containsKey(val)) return false;
values.add(val);
valuesIndexes.put(val, values.size() - 1);
return true;
}
/** Removes a value from the set. Returns true if the set contained the specified element. */
public boolean remove(int val) {
if (!valuesIndexes.containsKey(val)) return false;
//Swap last with val index, so removal is O(1)
//P.S: We don't have to store the element to remove
int index = valuesIndexes.get(val);
int lastValue = values.get(values.size() - 1);
values.set(index, lastValue);
//Remove last
values.remove(values.size() - 1);
//Update indexes
valuesIndexes.remove(val);
if (lastValue != val) valuesIndexes.put(lastValue, index);
return true;
}
/** Get a random element from the set. */
public int getRandom() {
int index = rand.nextInt(values.size());
return values.get(index);
}
}
/**
* Your RandomizedSet object will be instantiated and called as such:
* RandomizedSet obj = new RandomizedSet();
* boolean param_1 = obj.insert(val);
* boolean param_2 = obj.remove(val);
* int param_3 = obj.getRandom();
*/