forked from seanprashad/leetcode-patterns
- Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path380_Insert_Delete_GetRandom_O(1).java
52 lines (43 loc) · 1.21 KB
/
380_Insert_Delete_GetRandom_O(1).java
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
classRandomizedSet {
privateList<Integer> list;
privateMap<Integer, Integer> hm;
/** Initialize your data structure here. */
publicRandomizedSet() {
list = newArrayList<>();
hm = newHashMap<>();
}
/**
* Inserts a value to the set. Returns true if the set did not already contain
* the specified element.
*/
publicbooleaninsert(intval) {
if (hm.containsKey(val)) {
returnfalse;
}
list.add(val);
hm.put(val, list.size() - 1);
returntrue;
}
/**
* Removes a value from the set. Returns true if the set contained the specified
* element.
*/
publicbooleanremove(intval) {
if (!hm.containsKey(val)) {
returnfalse;
}
intidx = hm.get(val);
intlastElement = list.get(list.size() - 1);
list.set(idx, lastElement);
list.remove(list.size() - 1);
hm.put(lastElement, idx);
hm.remove(val);
returntrue;
}
/** Get a random element from the set. */
publicintgetRandom() {
Randomrand = newRandom();
intrandIdx = rand.nextInt(list.size());
returnlist.get(randIdx);
}
}