如何使此代码在链表中检测回文包含所有情况？

# 定义链表节点
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

# 反转链表
def reverseList(head):
    prev = None
    curr = head
    while curr:
        next_node = curr.next
        curr.next = prev
        prev = curr
        curr = next_node
    return prev

# 检测回文链表
def isPalindrome(head):
    if not head or not head.next:
        return True
    
    # 找到链表的中间节点
    slow = head
    fast = head
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
    
    # 反转链表的后半部分
    second_half = reverseList(slow)
    
    # 比较链表的前半部分和反转后的后半部分
    first_half = head
    while second_half:
        if first_half.val != second_half.val:
            return False
        first_half = first_half.next
        second_half = second_half.next
    
    return True