题解 | #链表的回文结构#

import java.util.*;

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class PalindromeList {
    public boolean chkPalindrome(ListNode A) {
        ListNode slow = A;
        ListNode fast = A;
        while(fast != null && fast.next != null){
            fast = fast.next.next;
            slow = slow.next;
        }
        ListNode cur = slow.next;
        while(cur != null){
            ListNode curN = cur.next;
            cur.next = slow;
            slow = cur;
            cur = curN;
        }
        while(A != slow){
            if(A.val == slow.val){
                if(A.next == slow){
                    return true;
                }
                A = A.next;
                slow = slow.next;
            }
            else{
                return false;
            }
        }
        return true;

    }
}