LeetCode234：Palindrome Linked List

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

Example 1:

Input: 1->2
Output: false

Example 2:

Input: 1->2->2->1
Output: true

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

---

LeetCode：链接

这道题我首先想的就是翻转整个链表，然后再从头到尾比较，但是发现一直ac不过去，后来我发现问题的所在，我在翻转链表之后，这个链表已经改变了，如果我重头去遍历，遍历的是翻转之后的链表，除非新创建一个和原来一模一样的链表才可以。

正确做法：1、遍历链表，快慢指针，找到链表后半部分。
2、反转链表，可以参考LeetCode206：Reverse Linked List
3、然后比较前半部分和后半部分的val值，比较的是val的大小！！！！！

# 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
        slow = fast = head
        while fast and fast.next:
            slow = slow.next
            fast = fast.next.next
        reverse_head = self.reverse(slow)
        while head and reverse_head:
            if head.val != reverse_head.val:
                return False
            head = head.next
            reverse_head = reverse_head.next
        return True

    def reverse(self, head):
        if not head or not head.next:
            return head
        last = None
        while head:
            tmp = head.next
            head.next = last
            last = head
            head = tmp
        return last