【python3】leetcode 705. Design HashSet(easy)
阿新 • • 發佈:2018-12-19
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)
設計hashset類的實現
class MyHashSet: 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 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)