python数据结构之双向链表的实现

python数据结构之双向链表的实现

双向链表也叫双链表，是链表的一种，它的每个数据结点中都有两个指针，分别指向直接后继和直接前驱。所以，从双向链表中的任意一个结点开始，都可以很方便地访问它的前驱结点和后继结点。

class Node(object):
    """节点"""

    def __init__(self, item):
        self.item = item
        self.next = None
        self.prev = None


class DoubleLinkList(object):
    """双向链表"""

    def __init__(self, node=None):
        self.__head = node

    def is_empty(self):
        """链表是否为空"""
        return self.__head is None

    def length(self):
        """链表长度"""
        current_node = self.__head
        count = 0
        while current_node is not None:
            current_node = current_node.next
            count += 1
        return count

    def travel(self):
        """遍历整个链表"""
        current_node = self.__head
        while current_node is not None:
            print(current_node.item, end=' ')
            current_node = current_node.next
        print(' ')

    def add(self, item):
        """链表头部添加元素，头插法"""
        node = Node(item)
        current_node = self.__head
        if self.is_empty():
            self.__head = node
            node.prev = None
            node.next = None
        else:
            node.next = current_node
            node.prev = None
            self.__head = node

    def append(self, item):
        """链表尾部添加元素, 尾插法"""
        node = Node(item)
        if self.is_empty():
            node.next = None
            node.prev = None
            self.__head = node
        else:
            current_node = self.__head
            while current_node.next is not None:
                current_node = current_node.next
            current_node.next = node
            node.prev = current_node
            node.next = None

    def search(self, item):
        """查找节点是否存在"""
        if self.is_empty():
            return False
        current_node = self.__head
        while current_node is not None:
            if item == current_node.item:
                return True
            current_node = current_node.next
        return False

    def insert(self, index, item):
        """指定位置添加元素
        :param  index 从0开始
        """
        if index <= 0:
            self.add(item)
        elif index >= self.length():
            self.append(item)
        else:
            pre_node = None
            current_node = self.__head
            while index >= 1:
                index -= 1
                pre_node = current_node
                current_node = current_node.next
            node = Node(item)
            node.prev = pre_node
            pre_node.next = node
            node.next = current_node
            current_node.prev = node

    def remove(self, item):
        """删除节点"""
        current_node = self.__head
        while current_node is not None:
            if current_node.item == item:
                if current_node == self.__head:
                    self.__head = current_node.next
                    if current_node.next:
                        current_node.next.prev = None  # 判断链表是否只有一个结点
                else:
                    current_node.prev.next = current_node.next
                    if current_node.next:
                        current_node.next.prev = current_node.prev
                break
            else:
                current_node = current_node.next


if __name__ == '__main__':
    double_link = DoubleLinkList()
    print(double_link.is_empty())
    print(double_link.length())
    double_link.travel()

    print('Search:', double_link.search(100))

    double_link.add(100)
    print(double_link.is_empty())
    print('Len:', double_link.length())
    double_link.travel()
    double_link.add(200)
    print('Len:', double_link.length())
    double_link.travel()
    double_link.add(300)
    print('Len:', double_link.length())
    double_link.travel()
    double_link.add(400)
    double_link.travel()
    double_link.append(-100)
    print(double_link.search(0))
    print(double_link.search(100))
    double_link.travel()

    double_link.insert(4, 0)
    double_link.travel()

    double_link.remove(-100)
    double_link.travel()