python回文链表

import sys


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


def strToList(s):
    # 一行数字转换为 ListNode
    nums = s.split(' ')
    L = ListNode(0)
    head = L
    for n in nums:
        head.next = ListNode(int(n))
        head = head.next
    return L.next


def listToStr(l):
    # ListNode 转换为一行数字
    res = ''
    while l:
        res += str(l.val) + ' '
        l = l.next
    return res[:-1]


# 逆置不带头结点的单链表
def reverse(head):
    h = ListNode(0)
    p = head
    while p != None:
        q = p.next
        p.next = h.next
        h.next = p
        p = q
    return h.next


def isPalindrome(head):
    if head == None:
        return True
    slow = fast = head
    # 查找中间结点slow
    while fast != None and fast.next != None and fast.next.next != None:
        slow = slow.next  # 慢指针每次后移1个结点
        fast = fast.next.next  # 快指针每次后移2个结点
    h = slow.next
    slow.next = None
    q = reverse(h)  # 逆置不带头结点的单链表h
    p = head
    while p != None and q != None:  # 比较对应的结点值
        if p.val != q.val:
            return False
        p = p.next
        q = q.next
    if q == None:
        return True
    else:
        return False

if __name__ == '__main__':
   
    l = strToList(sys.stdin.readline())
    print(isPalindrome(l))