Description
Difficulty: Easy
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
最简单的想法是把链表的值按顺序输出到一个数组,在判断数组是否回文;
判断数组是否回文,也就是判断前一半的逆序是否与后一半相等。
|
|

Difficulty: Easy
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?
题意:
判断一个链表是否回文。
最简单的想法是把链表的值按顺序输出到一个数组,在判断数组是否回文;
判断数组是否回文,也就是判断前一半的逆序是否与后一半相等。
|
|
近期评论