705. Design HashSet
Design a HashSet without using any built-in hash table libraries.
Implement MyHashSet class:
void add(key)Inserts the valuekeyinto the HashSet.bool contains(key)Returns whether the valuekeyexists in the HashSet or not.void remove(key)Removes the valuekeyin the HashSet. Ifkeydoes not exist in the HashSet, do nothing.
Example 1:
Input ["MyHashSet", "add", "add", "contains", "contains", "add", "contains", "remove", "contains"] [[], [1], [2], [1], [3], [2], [2], [2], [2]] Output [null, null, null, true, false, null, true, null, false] Explanation MyHashSet myHashSet = new MyHashSet(); myHashSet.add(1); // set = [1] myHashSet.add(2); // set = [1, 2] myHashSet.contains(1); // return True myHashSet.contains(3); // return False, (not found) myHashSet.add(2); // set = [1, 2] myHashSet.contains(2); // return True myHashSet.remove(2); // set = [1] myHashSet.contains(2); // return False, (already removed)
Constraints:
0 <= key <= 106- At most
104calls will be made toadd,remove, andcontains.
GoogleTopics
Loading editor…
1class MyHashSet:
2
3 def __init__(self):
4
5
6 def add(self, key: int) -> None:
7
8
9 def remove(self, key: int) -> None:
10
11
12 def contains(self, key: int) -> bool:
13
14
15
16# Your MyHashSet object will be instantiated and called as such:
17# obj = MyHashSet()
18# obj.add(key)
19# obj.remove(key)
20# param_3 = obj.contains(key)
Starter codePython 3Spaces: 4
Loading editor…
1class MyHashSet:
2
3 def __init__(self):
4
5
6 def add(self, key: int) -> None:
7
8
9 def remove(self, key: int) -> None:
10
11
12 def contains(self, key: int) -> bool:
13
14
15
16# Your MyHashSet object will be instantiated and called as such:
17# obj = MyHashSet()
18# obj.add(key)
19# obj.remove(key)
20# param_3 = obj.contains(key)
Starter codePython 3Spaces: 4
Examples
Input
["MyHashSet","add","add","contains","contains","add","contains","remove","contains"] [[],[1],[2],[1],[3],[2],[2],[2],[2]]
Your code is saved on this device.Solution