Package g0701_0800.s0705_design_hashset
Class MyHashSet
java.lang.Object
g0701_0800.s0705_design_hashset.MyHashSet
705 - Design HashSet.<p>Easy</p>
<p>Design a HashSet without using any built-in hash table libraries.</p>
<p>Implement <code>MyHashSet</code> class:</p>
<ul>
<li><code>void add(key)</code> Inserts the value <code>key</code> into the HashSet.</li>
<li><code>bool contains(key)</code> Returns whether the value <code>key</code> exists in the HashSet or not.</li>
<li><code>void remove(key)</code> Removes the value <code>key</code> in the HashSet. If <code>key</code> does not exist in the HashSet, do nothing.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><strong>Input</strong></p>
<pre><code> ["MyHashSet", "add", "add", "contains", "contains", "add", "contains", "remove", "contains"]
[ [], [1], [2], [1], [3], [2], [2], [2], [2]]
</code></pre>
<p><strong>Output:</strong> [null, null, null, true, false, null, true, null, false]</p>
<p><strong>Explanation:</strong></p>
<pre><code> MyHashSet myHashSet = new MyHashSet();
myHashSet.add(1); // set = [1]
myHashSet.add(2); // set = [1, 2]
myHashSet.contains(1); // return True
myHashSet.contains(3); // return False, (not found)
myHashSet.add(2); // set = [1, 2]
myHashSet.contains(2); // return True
myHashSet.remove(2); // set = [1]
myHashSet.contains(2); // return False, (already removed)
</code></pre>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>0 <= key <= 10<sup>6</sup></code></li>
<li>At most <code>10<sup>4</sup></code> calls will be made to <code>add</code>, <code>remove</code>, and <code>contains</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
MyHashSet
public MyHashSet()
-
-
Method Details
-
add
public void add(int key) -
remove
public void remove(int key) -
contains
public boolean contains(int key)
-