Leetcode:705. Design HashSet

题目:

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:

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

    def add(self, key: int) -> None:
        if key < 0 or key > 1000000:
            return None
        self.data.add(key)

    def remove(self, key: int) -> None:
        if key < 0 or key > 1000000:
            return None
        self.data.discard(key)

    def contains(self, key: int) -> bool:
        """
        Returns true if this set contains the specified element
        """
        if key < 0 or key > 1000000:
            return None
        if key in self.data:
            #print("True")
            return True
        else:
            #print("False")
            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)
Author Rewards

Leave a Reply

Your email address will not be published. Required fields are marked *