链表的回文

题目

代码

class Solution {
    public boolean isPalindrome(ListNode head) {       
        if (head == null) {
            return true;
        }
        // 寻找分割点,这个点算做前一半链表
        ListNode syncopationPoint = earchSyncopationPoint(head);
        //翻转切分点后面的链表
        ListNode reverseListNode = reverseList(syncopationPoint.next);
        //回文
        ListNode p1 = head;
        ListNode p2 = reverseListNode;
        boolean result = true;
        while(result && p2 != null) {
            if (p1.val != p2.val) {
                result = false;
            }
            p1 = p1.next;
            p2 = p2.next;
        }
        //变回原来的样子（可以不带这步）
        syncopationPoint.next = reverseList(reverseListNode);
        return result;
    }
    
    // 链表的反转
    private ListNode reverseList(ListNode head) {
        ListNode pre = null;
        ListNode cur = head;
        while(cur != null) {
            ListNode temp = cur.next;
            cur.next = pre;
            pre = cur;
            cur = temp;
        }
        return pre;
    }

    // 寻找切分点
    private ListNode earchSyncopationPoint(ListNode head) {
        ListNode fast = head, slow = head;
        while (fast.next != null && fast.next.next != null){
            fast = fast.next.next;
            slow = slow.next;
        }
        return slow;
    }

}