是否可以反转包含循环的链表？

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

def reverse_circular_linked_list(head: ListNode) -> ListNode:
    if not head or not head.next:
        return head

    # 找到循环起始节点
    slow, fast = head, head
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
        if slow == fast:
            break

    # 反转循环部分
    prev, curr = None, slow
    while curr != slow or not prev:
        temp = curr.next
        curr.next = prev
        prev = curr
        curr = temp

    # 反转整个链表
    prev, curr = None, head
    while curr != slow:
        temp = curr.next
        curr.next = prev
        prev = curr
        curr = temp

    # 将循环部分的前一个节点指向循环起始节点
    curr.next = prev

    return prev