双向链表

双链表 python实现

class Node(object):
    """
    定义节点
    """
    def __init__(self, item):
        self.elem = 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):
        cur = self.__head
        count = 0
        while cur is not None:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        cur = self.__head
        if self.is_empty():
            print("空列表")
        else:
            while cur is not None:
                print(cur.elem, end=' ')
                cur = cur.next
            print('')

    # 可以看到这部分以上的代码都和单链表一模一样，可以通过class DoubleLinkList(SingleLinkList)继承实现
    # 所以以上的代码都可删除，只要实现以下的代码即可
    # 这就是面向对象的思想，封装

    def add(self, item):
        node = Node(item)
        node.next = self.__head
        self.__head = node
        node.next.prev = node # 有一个思想误区，连接域指向的是node整体，elem，prev和next一样是node下面的三个部分，但是prev和next应该指向的是node

    def append(self, item):
        node = Node(item)
        if self.is_empty():
            self.__head = node
        else:
            cur = self.__head 
            while cur.next is not None:
                cur = cur.next
            cur.next = node
            node.prev = cur

    def insert(self, pos, item):
        if pos <= 0:
            self.add(item)
        elif pos >= (self.length()-1):
            self.append(item)
        else:
            cur = self.__head
            count = 0
            while count <= pos-1:
                count += 1
                cur = cur.next
            node = Node(item)
            # 最好先写node的关系，不容易出错
            node.prev = cur.prev
            node.next = cur
            cur.prev.next = node
            cur.prev = node

    def remove(self, item):
        """
        删除元素
        """
        # 考虑头结点，因为你的判断依据是cur.next.elem
        # 考虑只有一个头结点，
        cur = self.__head
        if cur.elem == item:
            if cur.next is not None:
                self.__head = cur.next
                cur.next.prev = None
            else:
                self.__head = None
            return   

        while cur is not None:           
            if cur.elem == item:
             # 将cur的前一个节点的next指向cur的后一个节点
                cur.prev.next = cur.next
            # 将cur的后一个节点的prev指向cur的前一个节点
                cur.next.prev = cur.prev
                break
            cur = cur.next
        print("没有要删除的数")

    def search(self, item):
        """
        查找元素
        """
        cur = self.__head
        while cur is not None:
            if cur.elem != item:
                return True
            else:
                cur = cur.next
        return False


ll = DoubleLinkList()
ll.append(1)
ll.append(2)
ll.append(3)
ll.append(4)
ll.append(5)
ll.travel()
ll.add(10)
ll.travel()
ll.insert(3, 200)
ll.insert(-1,100)
ll.insert(20, 300)
ll.travel()
ll.remove(20)
ll.travel()