0706-design-hashmap.py

classListNode:
def__init__(self, key=-1, val=-1, next=None):
self.key=key
self.val=val
self.next=next

classMyHashMap:
def__init__(self):
self.map= [ListNode() foriinrange(1000)]

defhashcode(self, key):
returnkey%len(self.map)

defput(self, key: int, value: int) ->None:
cur=self.map[self.hashcode(key)]
whilecur.next:
ifcur.next.key==key:
cur.next.val=value
return
cur=cur.next
cur.next=ListNode(key, value)

defget(self, key: int) ->int:
cur=self.map[self.hashcode(key)].next
whilecurandcur.key!=key:
cur=cur.next
ifcur:
returncur.val
return-1

defremove(self, key: int) ->None:
cur=self.map[self.hashcode(key)]
whilecur.nextandcur.next.key!=key:
cur=cur.next
ifcurandcur.next:
cur.next=cur.next.next