一、题目描述
给你一个单链表的头节点 head ,请你判断该链表是否为回文链表。如果是,返回 true ;否则,返回 false 。
示例 1:
输入:head = [1,2,2,1]
输出:true
示例 2:
输入:head = [1,2]
输出:false
二、解题
双指针-快慢指针
使用快慢指针,将慢指针的前半部分就地反转,然后遍历即可。很巧妙的方法
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public boolean isPalindrome(ListNode head) {
if (head == null || head.next == null) return true;
//双指针 快慢指针
ListNode slow = head,fast = head;
ListNode pre = head,cur = null;
while(fast != null && fast.next != null){
//保存之前的慢节点 原地将前半部分逆序
pre = slow;
//更新快慢节点
slow = slow.next;
fast = fast.next.next;
//将前半部分逆序
pre.next = cur;
cur = pre;
}
//判断奇偶 保证从中间节点向两边指向
if(fast != null){
slow = slow.next;
}
while(pre != null && slow != null){
if(pre.val != slow.val){
return false;
}
pre = pre.next;
slow = slow.next;
}
return true;
}
}
快慢指针+翻转链表
class Solution {
public boolean isPalindrome(ListNode head) {
//链表拆分+链表翻转+快慢指针
ListNode slow = head,fast = head;
while(fast != null && fast.next != null){
slow = slow.next;
fast = fast.next.next;
}
//判断奇偶性 fast != null 是奇数 fast == null 是偶数
if(fast != null){
slow = slow.next;
}
//翻转链表
ListNode node = reverse(slow);
while(node!=null){
if(node.val != head.val){
return false;
}
node = node.next;
head = head.next;
}
return true;
}
//翻转链表
public ListNode reverse(ListNode head){
if(head == null || head.next == null){
return head;
}
ListNode cur = reverse(head.next);
head.next.next = head;
head.next = null;
return cur;
}
}