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?
见程序注释
Name | Name | Last commit date | ||
---|---|---|---|---|
parent directory.. | ||||
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?
见程序注释