回文链表:给你一个单链表的头节点 head
,请你判断该链表是否为回文链表。如果是,返回 true
;否则,返回 false
。
题目思路:递归,双指针
解法一:递归
class Solution {
private ListNode pre;
//递归
public boolean isPalindrome(ListNode head) {
pre = head;
return check(head);
}
private boolean check(ListNode cur) {
if (cur != null) {
if (!check(cur.next)) {
return false;
}
if (cur.val != pre.val) {
return false;
}
pre = pre.next;
}
return true;
}
}
解法二:转换为数组,使用双指针
class Solution {
public boolean isPalindrome0(ListNode head) {
List<Integer> vals = new ArrayList<>();
int i = 0;
while (head != null) {
vals.add(head.val);
head = head.next;
}
int p1 = 0, p2 = vals.size() - 1;
while (p1 < p2) {
if (!vals.get(p1).equals(vals.get(p2))) {
return false;
}
p1++;
p2--;
}
return true;
}
}