leecode-234-回文链表

/**
 * 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 {
    // 左侧指针
    ListNode left;
    public boolean isPalindrome(ListNode head) {
        left = head;
        return traverse(head);
    }
    public boolean traverse(ListNode right) {
        // base case
        if (right == null) return true;
        boolean ans = traverse(right.next);
        // 后序遍历,相当于反转联表
        ans = ans && (right.val == left.val);
        left = left.next;
        return ans;
    }
}

进阶：
用 O(n) 时间复杂度和 O(1) 空间复杂度解决

/**
 * 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) {
        // 通过快慢指针来找到链表中点
        ListNode slow;
        ListNode fast;
        slow = fast = head;
        while (fast != null && fast.next != null) {
            slow = slow.next;
            fast = fast.next.next;
        }
        // slow 指针现在指向链表中点
        // 链表长度如果为奇数，slow 再前进一步
        if (fast != null)
        slow = slow.next;
        // 反转链表进行比较 
        ListNode left = head;
        ListNode right = reverse(slow);

        while (right != null) {
            if (left.val != right.val)
                return false;
            left = left.next;
            right = right.next;
        }
        return true;
    }
    // 辅助函数，反转链表
    public ListNode reverse(ListNode head) {
        ListNode pre = null, cur = head;
        while (cur != null) {
            ListNode next = cur.next;
            cur.next = pre;
            pre = cur;
            cur = next;
        }
        return pre;
    }
}