【leetcode】705. 设计哈希集合

typedef struct {
    int hash[1000001];
} MyHashSet;
/** Initialize your data structure here. */
MyHashSet* myHashSetCreate() {
    MyHashSet* obj=(MyHashSet*)calloc(sizeof(MyHashSet),1);
    return obj;
}

void myHashSetAdd(MyHashSet* obj, int key) {
    obj->hash[key]=1;
}

void myHashSetRemove(MyHashSet* obj, int key) {
    obj->hash[key]=0;
}

/** Returns true if this set contains the specified element */
bool myHashSetContains(MyHashSet* obj, int key) {
    return obj->hash[key];
}

void myHashSetFree(MyHashSet* obj) {
    free(obj);
}

标签：obj,哈希,int,705,void,key,hash,MyHashSet,leetcode
来源： https://www.cnblogs.com/ganxiang/p/14018748.html