705. 设计哈希集合

题目描述

705. 设计哈希集合

解法：数组+链表

开放地址冲突法

class MyHashSet {

private:
    vector<list<int>> map;
    static const int base = 769;
    static int hash(int key){return key%base;}

public:
    /** Initialize your data structure here. */
    MyHashSet():map(base){}
    
    void add(int key) {
        int h = hash(key);
        for(auto it=map[h].begin();it!=map[h].end();it++)
            if(*(it)==key) return;
        map[h].push_back(key);
    }
    
    void remove(int key) {
        int h = hash(key);
        for(auto it=map[h].begin();it!=map[h].end();it++)
        {
            if(*(it)==key)
            {
                map[h].erase(it);
                return;
            }
        }
    }
    
    /** Returns true if this set contains the specified element */
    bool contains(int key) {
        int h = hash(key);
        for(auto it=map[h].begin();it!=map[h].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);
 */