题目：
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?
碉堡！
reference：http://www.cnblogs.com/grandyang/p/4635425.html
转载于:https://www.cnblogs.com/hygeia/p/4763076.html
相关资源：JAVA上百实例源码以及开源项目
