package
Version:
v0.0.0-...-db5e768
Opens a new window with list of versions in this module.
Published: Jul 25, 2019
License: MIT
Opens a new window with license information.
Imports: 0
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
README
¶
题目
Design a HashSetwithout 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 inthe 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.
解题思路
见程序注释
Documentation
¶
type MyHashSet struct {
}
MyHashSet object will be instantiated and called as such:
obj := Constructor();
obj.Add(key);
obj.Remove(key);
param_3 := obj.Contains(key);
Constructor initialize your data structure here. */
Contains returns true if this set contains the specified element */
Source Files
¶
Click to show internal directories.
Click to hide internal directories.