【Leetcode_easy】705. Design HashSet

problem

705. Design HashSet

题意：

solution1:

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

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

solution2:

 

参考

1. Leetcode_easy_705. Design HashSet;

2. Grandyang;

完

转载于:https://www.cnblogs.com/happyamyhope/p/11114781.html