-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathRandomizedSet.java
52 lines (43 loc) · 1.24 KB
/
RandomizedSet.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
package leetcode.algo.hash_mapping.leet_zh_1164;
import java.util.*;
class RandomizedSet {
public Map<Integer, Integer> hashMap;
/**
* Initialize your data structure here.
*/
public RandomizedSet() {
hashMap = new HashMap<>();
}
/**
* Inserts a value to the set. Returns true if the set did not already contain the specified element.
*/
public boolean insert(int val) {
if (hashMap.get(val) != null) {
return false;
}
hashMap.put(val, val);
return true;
}
/**
* Removes a value from the set. Returns true if the set contained the specified element.
*/
public boolean remove(int val) {
return hashMap.remove(val, val);
}
/**
* Get a random element from the set.
*/
public int getRandom() {
Random random = new Random();
Set set = hashMap.keySet();
int index = random.nextInt(hashMap.keySet().size());
return (Integer) set.toArray()[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();
*/