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 == None

    def length(self):
        """求双向链表长度"""
        count = 0
        cur = self.__head
        while cur != None:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        """遍历"""
        # 空链表
        if self.is_empty():
            return None
        # 非空链表
        cur = self.__head
        while cur != None:
            print(cur.item, end=' ')
            cur = cur.next
        print("")

    def add(self, item):
        """头部添加"""
        node = Node(item)
        # 空链表
        if self.is_empty():
            self.__head = node
        else:  # 非空链表
            node.next = self.__head
            self.__head.prev = node
            self.__head = 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):
        """指定位置插入"""
        if pos <= 0:
            self.add(item)
        elif pos > (self.length() - 1):
            self.append(item)
        else:
            node = Node(item)
            count = 0
            cur = self.__head
            while count < (pos - 1):
                count += 1
                cur = cur.next
            node.next = cur.next
            node.prev = cur
            cur.next.prev = node
            cur.next = node

    def remove(self, item):
        """删除结点"""
        # 空链表直接不进入循环
        if self.is_empty():
            return
        else:
            cur = self.__head
            # 如果首结点就是要删除的元素
            if cur.item == item:
                # 如果链表只有一个节点
                if cur.next == None:
                    self.__head = None
                else:
                    cur.next.prev = None
                    self.__head = cur.next
                return

            while cur != None:
                if cur.item == item:
                     cur.prev.next = cur.next
                     # cur没有指向表尾
                     if cur.next:
                        cur.next.prev = cur.prev
                     break
                cur = cur.next


    def search(self, item):
        """查找"""
        cur = self.__head
        while cur != None:
            if cur._item == item:
                return True
            else:
                # 让游标继续查找
                cur = cur._next
        return False


if __name__ == '__main__':
    d = DoubleLinkList()
    print(d.is_empty())
    print(d.length())
    d.travel()
    d.add(111)
    d.add(888)
    d.append(222)
    d.travel()
    d.insert(2, 444)
    d.insert(-1, 555)
    d.insert(5, 666)
    d.travel()
    d.remove(111)
    d.travel()