前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Leetcode 706. Design HashMap

Leetcode 706. Design HashMap

作者头像
Tyan
发布2021-03-15 18:35:02
2590
发布2021-03-15 18:35:02
举报
文章被收录于专栏:SnailTyan

文章作者:Tyan 博客:noahsnail.com | CSDN | 简书

1. Description

Design HashMap
Design HashMap

2. Solution

  • Version 1
代码语言:javascript
复制
class MyHashMap:

    def __init__(self):
        self.maps = [[] for _ in range(1000)]


    def put(self, key: int, value: int) -> None:
        index = self.hash(key)
        self.remove(key)
        self.maps[index].append([key, value])


    def get(self, key: int) -> int:
        index = self.hash(key)
        for k, v in self.maps[index]:
            if k == key:
                return v
        return -1
        

    def remove(self, key: int) -> None:
        index = self.hash(key)
        for k, v in self.maps[index]:
            if k == key:
                self.maps[index].remove([k, v])
                break


    def hash(self, key):
        return key % 1000
  • Version 2
代码语言:javascript
复制
class ListNode:
    def __init__(self, key, value):
        self.key = key
        self.value = value
        self.next = None


class MyHashMap:

    def __init__(self):
        self.maps = [None] * 1000


    def put(self, key: int, value: int) -> None:
        index = self.hash(key)

        if self.maps[index] is None:
            self.maps[index] = ListNode(key, value)
        else:
            current = self.maps[index]
            while True:
                if current.key == key:
                    current.value = value
                    break
                elif current.next is None:
                    current.next = ListNode(key, value)
                    break
                current = current.next


    def get(self, key: int) -> int:
        index = self.hash(key)
        current = self.maps[index]
        while current:
            if current.key == key:
                return current.value
            current = current.next
        return -1


    def remove(self, key: int) -> None:
        index = self.hash(key)
        current = self.maps[index]
        if current is not None and current.key == key:
            self.maps[index] = current.next
        else:
            while current:
                if current.key == key:
                    pre.next = current.next
                    break
                pre = current
                current = current.next


    def hash(self, key):
        return key % 1000

Reference

  1. https://leetcode.com/problems/design-hashmap/
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2021/02/25 ,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • 1. Description
  • 2. Solution
  • Reference
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档