[LeetCode&Python] Problem 705. Design HashSet

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了[LeetCode&Python] Problem 705. Design HashSet，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1434字，纯文字阅读大概需要3分钟。

内容图文

Design a HashSet without using any built-in hash table libraries.

To be specific, your design should include these functions:

• add(value): Insert a value into the HashSet. 
• contains(value) : Return whether the value exists in the HashSet or not.
• remove(value): Remove a value in the HashSet. If the value does not exist in the HashSet, do nothing.

Example:

MyHashSet hashSet = new MyHashSet();
hashSet.add(1);         
hashSet.add(2);         
hashSet.contains(1);    // returns true
hashSet.contains(3);    // returns false (not found)
hashSet.add(2);          
hashSet.contains(2);    // returns true
hashSet.remove(2);          
hashSet.contains(2);    // returns false (already removed)

Note:

• All values will be in the range of [0, 1000000].
• The number of operations will be in the range of [1, 10000].
• Please do not use the built-in HashSet library.

class MyHashSet(object):

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.hashSet=set()
        

    def add(self, key):
        """
        :type key: int
        :rtype: void
        """
        self.hashSet.add(key)

    def remove(self, key):
        """
        :type key: int
        :rtype: void
        """
        if key in self.hashSet:
            self.hashSet.remove(key)

    def contains(self, key):
        """
        Returns true if this set contains the specified element
        :type key: int
        :rtype: bool
        """
        if key in self.hashSet:
            return True
        else:
            return False


# Your MyHashSet object will be instantiated and called as such:
# obj = MyHashSet()
# obj.add(key)
# obj.remove(key)
# param_3 = obj.contains(key)

内容总结

以上是互联网集市为您收集整理的[LeetCode&Python] Problem 705. Design HashSet全部内容，希望文章能够帮你解决[LeetCode&Python] Problem 705. Design HashSet所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端