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)
原文地址:https://www.cnblogs.com/chiyeung/p/10086972.html
时间: 2024-10-07 23:06:21