-
Notifications
You must be signed in to change notification settings - Fork 2.4k
Expand file tree
/
Copy pathProblem_2.py
More file actions
51 lines (43 loc) · 1.49 KB
/
Problem_2.py
File metadata and controls
51 lines (43 loc) · 1.49 KB
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
class MyHashMap:
def __init__(self):
self.buckets = 1000
self.subbuckets = 1000
self.my_map = [None] * self.buckets
def _hash1(self, key):
return key % self.buckets
def _hash2(self, key):
return key // self.subbuckets
def put(self, key: int, value: int) -> None:
currentBucket = self._hash1(key)
if self.my_map[currentBucket] is None:
if currentBucket == 0:
self.my_map[currentBucket] = [-1] * (self.subbuckets + 1)
else:
self.my_map[currentBucket] = [-1] * (self.subbuckets)
currentSubBucket = self._hash2(key)
self.my_map[currentBucket][currentSubBucket] = value
def get(self, key: int) -> int:
currentBucket = self._hash1(key)
if self.my_map[currentBucket] is None:
return -1
else:
currentSubBucket = self._hash2(key)
if self.my_map[currentBucket][currentSubBucket] != -1:
return self.my_map[currentBucket][currentSubBucket]
return -1
def remove(self, key: int) -> None:
currentBucket = self._hash1(key)
if self.my_map[currentBucket] is None:
return
else:
currentSubBucket = self._hash2(key)
self.my_map[currentBucket][currentSubBucket] = -1
myHashMap = MyHashMap();
myHashMap.put(1, 1)
myHashMap.put(2, 2)
myHashMap.get(1)
myHashMap.get(3)
myHashMap.put(2, 1)
myHashMap.get(2)
myHashMap.remove(2)
myHashMap.get(2)