mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 20:26:07 -04:00
Create hash_map_array.py
This commit is contained in:
parent
1f174755c9
commit
606784af38
44
arrays_and_strings/hash_map_array.py
Normal file
44
arrays_and_strings/hash_map_array.py
Normal file
@ -0,0 +1,44 @@
|
||||
class HashMap:
|
||||
|
||||
def __init__(self, key_space):
|
||||
self.key_space = key_space
|
||||
self.table = [Bucket() for _ in range(self.key_space)]
|
||||
|
||||
def put(self, key: int, value: int):
|
||||
hash_key = key % self.key_space
|
||||
self.table[hash_key].put(key, value)
|
||||
|
||||
def get(self, key: int):
|
||||
hash_key = key % self.key_space
|
||||
return self.table[hash_key].get(key)
|
||||
|
||||
def remove(self, key: int):
|
||||
hash_key = key % self.key_space
|
||||
self.table[hash_key].remove(key)
|
||||
|
||||
|
||||
class Bucket:
|
||||
|
||||
def __init__(self):
|
||||
self.bucket = []
|
||||
|
||||
def get(self, key):
|
||||
for (k, v) in self.bucket:
|
||||
if k == key:
|
||||
return v
|
||||
return -1
|
||||
|
||||
def put(self, key, value):
|
||||
found = False
|
||||
for i, k in enumerate(self.bucket):
|
||||
if key == k[0]:
|
||||
self.bucket[i] = (key, value)
|
||||
found = True
|
||||
break
|
||||
if not found:
|
||||
self.bucket.append((key, value))
|
||||
|
||||
def remove(self, key):
|
||||
for i, k in enumerate(self.bucket):
|
||||
if key == k[0]:
|
||||
del self.bucket[i]
|
Loading…
x
Reference in New Issue
Block a user