数据结构与算法-简单双向循环链表实现

双向循环链表

# coding :utf-8
class LinkListNode(object):
    """双向循环链表节点"""

    def __init__(self, value):
        # 上指针
        self.prev = None
        # 值
        self.value = value
        # 下指针
        self.next = None


class DoubleLoopLinkList(object):
    """双向循环链表"""

    def __init__(self):
        '''初始化链表'''
        self.__head = None

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

    def length(self):
        '''获取链表长度'''
        if self.is_empty():
            return 0
        count = 1
        cur = self.__head
        while cur.next != self.__head:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        '''遍历链表'''
        if self.is_empty():
            print