705.md

705. 设计哈希集合

难度: Easy

class MyHashSet(object):
    def __init__(self):
        self.t = [-1]*1000000
    
    def add(self, key, value):
        self.t[key] = value
    
    def remove(self, key):
        self.t[key] = -1
        
    def contains(self, key):
        if self.t[key] == 1:
            return True
        else:
            return False