2019獨角獸企業重金招聘Python工程師標準>>>

這個我可能做的不是很符合題意，雖然AC了，但是沒有去用到hash函數之類的方式。同樣使用了位運算來搞定這一切，簡單易懂。上代碼如下：

typedef char MyHashSet;/** Initialize your data structure here. */ MyHashSet* myHashSetCreate() {int size = 100000/8+1;MyHashSet* obj = (MyHashSet*)malloc(sizeof(MyHashSet)*size);memset (obj,0,size);return obj; }void myHashSetAdd(MyHashSet* obj, int key) {int position = key/8;char area = key%8;char mask = 1<<area;*(obj+position) |=mask; }void myHashSetRemove(MyHashSet* obj, int key) {int position = key/8;char area = key%8;char mask = ~(1<<area);*(obj+position)&=mask; }/** Returns true if this set contains the specified element */ bool myHashSetContains(MyHashSet* obj, int key) {int position = key/8;char area = key%8;char mask = 1<<area;return (*(obj+position)&mask) == mask; }void myHashSetFree(MyHashSet* obj) {free(obj); }/*** Your MyHashSet struct will be instantiated and called as such:* struct MyHashSet* obj = myHashSetCreate();* myHashSetAdd(obj, key);* myHashSetRemove(obj, key);* bool param_3 = myHashSetContains(obj, key);* myHashSetFree(obj);*/

轉載于:https://my.oschina.net/zwyang/blog/3014058

總結

以上是生活随笔為你收集整理的刷leetcode第705题- 设计哈希集合的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。