哈希.png

哈希表.png

哈希沖突.png

解決哈希沖突--開放尋址法.png

解決哈希沖突--拉鏈法.png

# 鏈表


class SignLinklist:

    # 節(jié)點類
    class Node:
        def __init__(self, item):
            self.item = item
            self.next = None

        def __str__(self):
            return str(self.item)

    # 可迭代鏈表類
    class LinklistIterator:
        def __init__(self, node):
            self.node = node

        def __next__(self):
            if self.node:
                cur_node = self.node
                self.node = cur_node.next
                return cur_node.item
            else:
                raise StopIteration

        def __iter__(self):
            return self

    def __init__(self, iterable=None):
        self.head = None
        self.tail = None
        if iterable:
            self.extend(iterable)

    # 添加節(jié)點
    def append(self, obj):
        node = SignLinklist.Node(obj)
        if not self.head:
            self.head = node
            self.tail = node
        else:
            self.tail.next = node
            self.tail = node

    # 批量添加節(jié)點
    def extend(self, iterable):
        for obj in iterable:
            self.append(obj)

    # 查找節(jié)點
    def find(self, obj):
        for n in self:
            if n == obj:
                return True
        else:
            return False

    # 遍歷鏈表
    def __iter__(self):
        return self.LinklistIterator(self.head)

    # print 調(diào)用打印鏈表
    def __repr__(self):
        return '<<' + ','.join(map(str, self)) + '>>'


# 哈希表 類似于集合
class HashTable:

    def __init__(self, size=100):
        self.size = size
        self.T = [SignLinklist() for x in range(self.size)]

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

    def insert(self, k):
        i = self.h(k)
        if self.find(k):
            print('Duplicated Insert')
        else:
            self.T[i].append(k)

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


if __name__ == '__main__':
    ht = HashTable()
    ht.insert(10)
    ht.insert(110)
    ht.insert(210)
    ht.insert(310)
    print(','.join(map(str, ht.T)))

    print(ht.find(210))

個人博客