具有一个元素的双循环链表的反向

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None
        self.prev = None

class DoubleCircularLinkedList:
    def __init__(self):
        self.head = None
        self.tail = None

    def add_element(self, data):
        new_node = Node(data)
        if self.head is None:
            self.head = new_node
            self.tail = new_node
            self.head.next = self.tail
            self.tail.prev = self.head
        else:
            new_node.prev = self.tail
            self.tail.next = new_node
            new_node.next = self.head
            self.head.prev = new_node
            self.tail = new_node

    def reverse(self):
        if self.head is None:
            return

        current = self.head
        while True:
            temp = current.next
            current.next = current.prev
            current.prev = temp
            current = current.prev
            if current == self.head:
                break

        self.head, self.tail = self.tail, self.head

    def print_list(self):
        if self.head is None:
            return

        current = self.head
        while True:
            print(current.data, end=" ")
            current = current.next
            if current == self.head:
                break

# 创建一个具有一个元素的双循环链表
dll = DoubleCircularLinkedList()
dll.add_element(10)

# 打印原始链表
print("原始链表：")
dll.print_list()

# 反向操作
dll.reverse()

# 打印反向后的链表
print("\n反向后的链表：")
dll.print_list()