solve problem Design Hashset

Author: P-ppc

README.md

@@ -212,6 +212,7 @@ All solutions will be accepted!
 |707|[Design Linked List](https://leetcode-cn.com/problems/design-linked-list/description/)|[java/py/js](./algorithms/DesignLinkedList)|Easy|
 |622|[Design Circular Queue](https://leetcode-cn.com/problems/design-circular-queue/description/)|[java/py/js](./algorithms/DesignCircularQueue)|Easy|
 |641|[Design Circular Deque](https://leetcode-cn.com/problems/design-circular-deque/description/)|[java/py/js](./algorithms/DesignCircularDeque)|Easy|
+|705|[Design Hashset](https://leetcode-cn.com/problems/design-hashset/description/)|[java/py/js](./algorithms/DesignHashset)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/DesignHashset/README.md

@@ -0,0 +1,2 @@
+# Design Hashset
+This problem is easy to solve

algorithms/DesignHashset/Solution.java

@@ -0,0 +1,29 @@
+class MyHashSet {
+    int[] buckets;
+    
+    /** Initialize your data structure here. */
+    public MyHashSet() {
+        buckets = new int[1000000];
+    }
+    
+    public void add(int key) {
+        buckets[key] = 1;
+    }
+    
+    public void remove(int key) {
+        buckets[key] = 0;
+    }
+    
+    /** Returns true if this set did not already contain the specified element */
+    public boolean contains(int key) {
+        return buckets[key] == 1;
+    }
+}
+
+/**
+ * Your MyHashSet object will be instantiated and called as such:
+ * MyHashSet obj = new MyHashSet();
+ * obj.add(key);
+ * obj.remove(key);
+ * boolean param_3 = obj.contains(key);
+ */

algorithms/DesignHashset/solution.js

@@ -0,0 +1,40 @@
+/**
+ * Initialize your data structure here.
+ */
+var MyHashSet = function() {
+    this.buckets = new Array(1000000)
+    this.buckets.fill(0)
+};
+
+/** 
+ * @param {number} key
+ * @return {void}
+ */
+MyHashSet.prototype.add = function(key) {
+    this.buckets[key] = 1
+};
+
+/** 
+ * @param {number} key
+ * @return {void}
+ */
+MyHashSet.prototype.remove = function(key) {
+    this.buckets[key] = 0
+};
+
+/**
+ * Returns true if this set did not already contain the specified element 
+ * @param {number} key
+ * @return {boolean}
+ */
+MyHashSet.prototype.contains = function(key) {
+    return this.buckets[key] === 1
+};
+
+/** 
+ * Your MyHashSet object will be instantiated and called as such:
+ * var obj = Object.create(MyHashSet).createNew()
+ * obj.add(key)
+ * obj.remove(key)
+ * var param_3 = obj.contains(key)
+ */

algorithms/DesignHashset/solution.py

@@ -0,0 +1,36 @@
+class MyHashSet(object):
+
+    def __init__(self):
+        """
+        Initialize your data structure here.
+        """
+        self.buckets = [0] * 1000000
+
+    def add(self, key):
+        """
+        :type key: int
+        :rtype: void
+        """
+        self.buckets[key] = 1
+
+    def remove(self, key):
+        """
+        :type key: int
+        :rtype: void
+        """
+        self.buckets[key] = 0
+
+    def contains(self, key):
+        """
+        Returns true if this set did not already contain the specified element
+        :type key: int
+        :rtype: bool
+        """
+        return self.buckets[key] == 1
+
+
+# Your MyHashSet object will be instantiated and called as such:
+# obj = MyHashSet()
+# obj.add(key)
+# obj.remove(key)
+# param_3 = obj.contains(key)