LC 234 Palindrome Linked List

LC 234 Palindrome Linked List
Question:
Given a singly linked list, determine if it is a palindrome.

Approach 1: Copy into Array List and then Use Two Pointer Technique
把Linked List 转为 Array List。用两个指针测试Array List。

Approach 2: Recursive (Advanced)
相当于用 stack 存储。

private ListNode frontPointer;
private boolean recursivelyCheck(ListNode currentNode) {
if (currentNode != null) {
if (!recursivelyCheck(currentNode.next)) return false;
if (currentNode.val != frontPointer.val) return false;
frontPointer = frontPointer.next;
}
return true;
}

例子
Input: 1->2->2->1

Output: true

1, head, currentNode, frontPointer -> 2 -> 2 -> 1
1 frontPointer -> 2 currentNode -> 2 -> 1
1 frontPointer -> 2 -> 2 currentNode -> 1
1 frontPointer -> 2 -> 2 -> 1 currentNode -> NULL
1 frontPointer -> 2 -> 2 -> 1 -> NULL currentNode ; Back-track
1 frontPointer -> 2 -> 2 -> 1 currentNode ( currentNode.val == frontPointer) Back-track
1 -> 2 frontPointer -> 2 currentNode -> 1 ( currentNode.val == frontPointer) Back-track
1 -> 2 currentNode -> 2 frontPointer -> 1 ( currentNode.val == frontPointer) Back-track
1 currentNode -> 2 -> 2 -> 1 frontPointer ( currentNode.val == frontPointer) Back-track
return True
Approach 3: Reverse Second Half In-place

例子

Input: 1->2->2->1
Output: true

 private ListNode endOfFirstHalf(ListNode head) {
        ListNode fast = head;
        ListNode slow = head;
        while (fast.next != null && fast.next.next != null) {
            fast = fast.next.next;
            slow = slow.next;
        }
        return slow;
    }

1 slow, fast -> 2 -> 2 -> 1
1 -> 2 slow-> 2 fast -> 1 ( fast .next .next == null)
1 head -> 2 firstHalfEnd ; 2 firstHalfEnd .next -> 1 (call reverseLinkedList)
1 head -> 2 ; Convert (2 firstHalfEnd .next -> 1 ) to 1 secondHalfStart -> 2
Compare head (Linked List) with secondHalfStart (LinkedList)