力扣 设计哈希集合

自己动手写一写发现收获其实还蛮大的。

#define MAXLENGTH 10000

class MyHashSet {
private:
    vector<int> set[MAXLENGTH];
    /*返回键的下标位置*/
    int getIndex(int key){
        return key%MAXLENGTH;
    }
    /*查找key对应的value*/
    int getPos(int key,int index){
        for(int i=0; i<set[index].size(); i++){
            if(set[index][i] == key){
                return i;
            }
        }
        return -1;
    }
public:
    /** Initialize your data structure here. */
    MyHashSet() {
        
    }
    
    void add(int key) {
        int index = getIndex(key);
        int pos = getPos(key, index);
        if(pos == -1){
            set[index].push_back(key);
        }
        return ;
    }
    
    void remove(int key) {
        int index = getIndex(key);
        int pos = getPos(key, index);
        if(pos == -1){
            return ;
        }
        set[index].erase(set[index].begin() + pos);
    }
    
    /** Returns true if this set contains the specified element */
    bool contains(int key) {
        int index = getIndex(key);
        int pos = getPos(key,index);
        if(pos == -1){
            return false;
        }
        return true;
    }

};

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