第九周作业leetcode——234. Palindrome Linked List

---

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?

solution：

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

class Solution:
    def isPalindrome(self, head):
        """
        :type head: ListNode
        :rtype: bool
        """
        s=[]
        while head:
			s.append(head.val)
			head = head.next
		for i in range(len(s)//2):
			if s[i] != s[len(s)-1-i]:
				return False
		return True