作者:~小明学编程
文章专栏:每日一练——Java
格言:目之所及皆为回忆,心之所想皆为过往
回文链表
链接
题目简介:
给你一个单链表的头节点 head
,请你判断该链表是否为回文链表。如果是,返回 true
;否则,返回 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.next==null) {
return true;
}
ListNode fast = head;
ListNode slow = head;
ListNode prev = null;
ListNode slowNext = null;
while(fast.next!=null&&fast.next.next!=null) {
System.out.println("1");
fast = fast.next.next;
slowNext = slow.next;
slow.next = prev;
prev = slow;
slow = slowNext;
}
if(fast.next==null) {
ListNode last = slow.next;
slow.next = prev;
slow = slow.next;
while(slow!=null) {
if(slow.val!=last.val) {
return false;
} else {
slow = slow.next;
last = last.next;
}
}
} else {
ListNode last = slow.next;
slow.next = prev;
while(slow!=null) {
if(slow.val!=last.val) {
return false;
} else {
slow = slow.next;
last = last.next;
}
}
}
return true;
}
}
代码的主体思路是首先利用快慢指针找到中间的节点,并且在寻找中间节点的时候反转链表的前半部分,之后再定义一个last节点向后走,我们的slow节点向前走,然后判断节点的值是否一致。