-
Notifications
You must be signed in to change notification settings - Fork 1
/
0705-design-hashset.py
52 lines (40 loc) · 1.3 KB
/
0705-design-hashset.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
45
46
47
48
49
50
51
52
class MyHashSet:
def __init__(self):
self.hashFunc = 10**4 + 7
self.arr = [LinkedList() for _ in range(self.hashFunc)]
def add(self, key: int) -> None:
L = self.arr[key % self.hashFunc]
L.add(key)
def remove(self, key: int) -> None:
L = self.arr[key % self.hashFunc]
L.remove(key)
def contains(self, key: int) -> bool:
L = self.arr[key % self.hashFunc]
_, node = L.search(key)
return not(node is None)
class Node:
def __init__(self, key=-1, next=None):
self.key = key
self.next = next
class LinkedList:
def __init__(self):
self.head = Node()
def add(self, key):
_, cur = self.search(key)
if not cur:
node = Node(key, self.head.next)
self.head.next = node
def remove(self, key):
prev, cur = self.search(key)
if cur:
prev.next = prev.next.next
def search(self, key):
prev, cur = self.head, self.head.next
while cur and cur.key != key:
prev, cur = prev.next, cur.next
return prev, cur
# Your MyHashSet object will be instantiated and called as such:
# obj = MyHashSet()
# obj.add(key)
# obj.remove(key)
# param_3 = obj.contains(key)