-
Notifications
You must be signed in to change notification settings - Fork 0
/
06-12-InsertDeleteGetRandomO(1).java
52 lines (47 loc) · 1.34 KB
/
06-12-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
class RandomizedSet {
HashMap<Integer, Integer> set;
ArrayList<Integer> list;
Random rand = new Random();
/**
* Initialize your data structure here.
*/
public RandomizedSet() {
set = new HashMap<>();
list = new ArrayList<>();
}
/**
* Inserts a value to the set. Returns true if the set did not already contain the specified element.
*/
public boolean insert(int val) {
if (set.containsKey(val)) return false;
set.put(val, list.size());
list.add(val);
return true;
}
/**
* Removes a value from the set. Returns true if the set contained the specified element.
*/
public boolean remove(int val) {
if (!set.containsKey(val)) return false;
int lelem = list.get(list.size() - 1);
int id = set.get(val);
list.set(id, lelem);
set.put(lelem, id);
set.remove(val);
list.remove(list.size() - 1);
return true;
}
/**
* Get a random element from the set.
*/
public int getRandom() {
return list.get(rand.nextInt(list.size()));
}
}
/**
* 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();
*/