forked from Sunchit/Coding-Decoded
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathInsertDeleteGetRandomO(1).java
58 lines (47 loc) · 1.59 KB
/
InsertDeleteGetRandomO(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
53
54
55
56
57
58
class RandomizedSet {
Map<Integer, Integer> map = null;
List<Integer> arrayList = null;
Random rand = null;
/** Initialize your data structure here. */
public RandomizedSet() {
map = new HashMap<>();
arrayList = 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(!map.containsKey(val)) {
map.put(val, arrayList.size());
arrayList.add(val);
return true;
} else{
return false;
}
}
/** Removes a value from the set. Returns true if the set contained the specified element. */
public boolean remove(int val) {
if(map.containsKey(val)) {
// replace from last always
Integer lastNodeVal = arrayList.get(arrayList.size()-1);
if(lastNodeVal== val){
arrayList.remove(arrayList.size()-1);
map.remove(new Integer(val));
return true;
}
int indexOfVal = map.get(val);
arrayList.set(indexOfVal, lastNodeVal);
map.put(lastNodeVal, indexOfVal);
arrayList.remove(arrayList.size()-1);
map.remove(new Integer(val));
return true;
} else {
return false;
}
}
/** Get a random element from the set. */
public int getRandom() {
int size = arrayList.size();
int index = rand.nextInt(size);
return arrayList.get(index);
}
}