python实现双向链表

双向链表节点实现：

# coding:utf-8

class Node(object):
    """定义双向链表节点"""
    def __init__(self, elem):
        self.elem = elem
        self.next = None
        self.prev = None

双向链表的增删查改等操作：

# coding:utf-8

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

    def __init__(self, node=None):
        """定义头节点"""
        self._head = node

    def is_empty(self):
        """链表判空"""
        return self._head is None

    def length(self):
        """链表长度"""
        # cur为游标，用来移动遍历节点
        cur = self._head
        # count记录数量
        count = 0
        while cur != None:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        """遍历打印整个链表"""
        cur = self._head
        while cur != None:
            print(cur.elem, end=" ")
            cur = cur.next
        print("")

    def add(self, item):
        """链表头部添加元素"""
        node = Node(item)
        node.next = self._head
        self._head = node
        node.next.prev = node

    def append(self, item):
        """链表尾部添加元素"""
        node = Node(item)
        if self.is_empty():
            self._head = node
        else:
            cur = self._head
            while cur.next != None:
                cur = cur.next
            cur.next = node
            node.prev = cur

    def insert(self, pos, item):
        """指定位置添加某一元素
        :param pos从0开始
        """
        if pos <= 0:
            self.add(item)
        elif pos > (self.length()-1):
            self.append(item)
        else:
            cur = self._head
            count = 0
            while count < pos:
                count += 1
                cur = cur.next
            # 当循环退出后，cur指向pos位置
            node = Node(item)
            node.next = cur
            node.prev = cur.prev
            cur.prev.next = node
            cur.prev = node

    def remove(self, item):
        """删除某一节点"""
        cur = self._head
        while cur != None:
            if cur.elem == item:
                # 先判断此节点是否为头节点
                if cur == self._head:
                    self._head = cur.next
                    if cur.next:
                        # 判断链表是否只有一个节点，即cur.next是否存在
                        cur.next.prev = None
                else:
                    cur.prev.next = cur.next
                    if cur.next:
                        cur.next.prev = cur.prev
                return
            else:
                cur = cur.next

    def search(self, item):
        """查找某一节点是否存在"""
        cur = self._head
        while cur != None:
            if cur.elem == item:
                return  True
            else:
                cur = cur.next
        return False