【LeetCode】234、Palindrome Linked List

1、题目要求：

Given a singly linked list, determine if it is a palindrome.

Follow up:

Could you do it in O(n) time and O(1) space?

2、参考：http://blog.csdn.net/coder_orz/article/details/51306985

用到快慢指针法、反转链表。而且要注意这两个函数是并列关系。

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def isPalindrome(self, head):
        """
        :type head: ListNode
        :rtype: bool
        """
        if not head or not head.next:
            return True
        
        fast = slow = head
        while fast.next and fast.next.next:
            fast = fast.next.next
            slow = slow.next
        
        slow = slow.next #进入后半段
        slow = self.reverseList(slow)
        
        while slow:
            if head.val != slow.val:
                return False
            head = head.next
            slow = slow.next
        else:
            return True
        
    def reverseList(self,head):
        new_head = None
        while head:
            p = head
            head = head.next
            p.next = new_head
            new_head = p
        return new_head