【leetcode 设计题 C++】705. Design HashSet

705. Design HashSet

class MyHashSet {
public:
    /** Initialize your data structure here. */
    const int BASE = 769;
    vector<list<int> > data = vector<list<int> >(769);

    int getHashCode(int key) {
        return key % BASE;
    }

    MyHashSet() {
    }
    
    void add(int key) {
        int hash_code = getHashCode(key);
        for(auto it = data[hash_code].begin(); it != data[hash_code].end(); it++) {
            if(*it == key) return ;
        }
        data[hash_code].push_back(key);
    }
    
    void remove(int key) {
        int hash_code = getHashCode(key);
        for(auto it = data[hash_code].begin(); it != data[hash_code].end(); it++) {
            if(*it == key) {
                data[hash_code].erase(it);
                return ;
            }
        }
    }
    
    /** Returns true if this set contains the specified element */
    bool contains(int key) {
        int hash_code = getHashCode(key);
        for(auto it = data[hash_code].begin(); it != data[hash_code].end(); it++) {
            if(*it == key) return true;
        }
        return false;
    }
};

/**
 * 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);
 */

class MyHashSet {
public:
    /** Initialize your data structure here. */
    vector<bool> HashSet = vector<bool>(1e6 + 1, false);
    MyHashSet() {
    }
    
    void add(int key) {
        HashSet[key] = true;
    }
    
    void remove(int key) {
        HashSet[key] = false;
    }
    
    /** Returns true if this set contains the specified element */
    bool contains(int key) {
        return HashSet[key];
    }
};

/**
 * 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);
 */