705. Design HashSet（python+cpp）

题目：

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.

解释：
感觉这道题目也可以像706. Design HashMap（python+cpp）一样用一个很长的list来解决问题，不知道为什么我刚开始还是用了自带的库函数，而且即使用库函数速度也很慢。
python代码：

class MyHashSet:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.data=[-1]*1000001
        
    def add(self, key):
        """
        :type key: int
        :rtype: void
        """
        if self.data[key]==-1:
            self.data[key]=1;
       
    def remove(self, key):
        """
        :type key: int
        :rtype: void
        """
        self.data[key]=-1;
      
    def contains(self, key):
        """
        Returns true if this set contains the specified element
        :type key: int
        :rtype: bool
        """
        return self.data[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)

c++代码：

class MyHashSet {
public:
    /** Initialize your data structure here. */
    vector<int> data;
    MyHashSet() {
        data=vector<int>(1000001,-1);

    }
    
    void add(int key) {
        if (data[key]==-1)
            data[key]=1;
    }
    
    void remove(int key) {
        data[key]=-1;
    }
    
    /** Returns true if this set contains the specified element */
    bool contains(int key) {
        return data[key]==1;
    }
};

/**
 * Your MyHashSet object will be instantiated and called as such:
 * MyHashSet obj = new MyHashSet();
 * obj.add(key);
 * obj.remove(key);
 * bool param_3 = obj.contains(key);
 */

总结：
可以用一个很长的list模拟hashmap or hashset