哈希表的实现

from 数据结构.链表的实现 import Link


# 类似于集合的哈希表
class HashTable(object):
    def __init__(self, size=100):
        self.size = size
        self.table = [Link() for _ in range(self.size)]

    def h(self, k):
        return k % self.size

    def remove(self, k):
        i = self.h(k)
        self.table[i].del_item(k)

    def insert(self, k):
        i = self.h(k)
        if self.find(k):
            print('Duplicated insert!', k)
        else:
            self.table[i].ins_tail(k)

    def find(self, k):
        i = self.h(k)
        return self.table[i].find(k)

    def __str__(self):
        return ','.join(map(str, self.table))


if __name__ == '__main__':
    ht = HashTable()
    ht.insert(1)
    ht.insert(2)
    ht.insert(3)
    ht.insert(102)
    ht.insert(102)
    print(ht)
    ht.remove(1)
    print(ht)