-
Notifications
You must be signed in to change notification settings - Fork 0
/
design-hashset_705.py
44 lines (33 loc) · 1.45 KB
/
design-hashset_705.py
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
# Design a HashSet without using any built-in hash table libraries.
# Implement MyHashSet class:
# void add(key) Inserts the value key into the HashSet.
# bool contains(key) Returns whether the value key exists in the HashSet or not.
# void remove(key) Removes the value key in the HashSet. If key does 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)
# ---------------------------------------Runtime 126 ms Beats 99.92% Memory 22.2 MB Beats 53.21%---------------------------------------
# Time Complexity O(1)
class MyHashSet:
def __init__(self):
self.container: set = set()
def add(self, key: int) -> None:
self.container.add(key)
def remove(self, key: int) -> None:
if self.contains(key):
self.container.remove(key)
def contains(self, key: int) -> bool:
return key in self.container