双向链表反向的实现是如何实现的？

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

class DoublyLinkedList:
    def __init__(self):
        self.head = None

    def append(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
        else:
            current = self.head
            while current.next:
                current = current.next
            current.next = new_node
            new_node.prev = current

    def reverse(self):
        current = self.head
        while current:
            # Swap prev and next pointers
            temp = current.prev
            current.prev = current.next
            current.next = temp
            # Move to the next node (which is now the previous node after swapping)
            current = current.prev
        # Update the head to the last node we visited
        if temp:
            self.head = temp.prev

    def display(self):
        current = self.head
        while current:
            print(current.data, end=" <-> ")
            current = current.next
        print("None")

# Example usage
dll = DoublyLinkedList()
dll.append(1)
dll.append(2)
dll.append(3)
dll.append(4)

print("Original Doubly Linked List:")
dll.display()

dll.reverse()

print("Reversed Doubly Linked List:")
dll.display()