Leetcode之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? 示例： 1->2->9->4->9->2->1    return true; 1->2->2->1          return true; 3->2

>>阅读原文<<