LeetCode-Algorithms-[Easy]234. 回文链表

请判断一个链表是否为回文链表。

示例 1:

输入: 1->2
输出: false

示例 2:

输入: 1->2->2->1
输出: true

进阶：

你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题？

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/palindrome-linked-list
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

---

    public boolean isPalindrome(ListNode head) {
        ListNode mid = getMiddle(head);
        reverse(mid);
        ListNode p = head;
        ListNode q = mid.next;
        while (p != null && q != null) {
            if (p.val != q.val) {
                return false;
            }
            p = p.next;
            q = q.next;
        }
        return true;
    }

    private void reverse(ListNode node) {
        ListNode current = node.next;
        node.next = null;

        while (current != null) {
            ListNode nextNode = current.next;
            current.next = node.next;
            node.next = current;
            current = nextNode;
        }
    }

    private ListNode getMiddle(ListNode head) {
        ListNode dummyHead = new ListNode(0);
        dummyHead.next = head;
        ListNode fast = dummyHead;
        ListNode slow = dummyHead;
        while (fast != null && fast.next != null) {
            fast = twoStep(fast);
            slow = slow.next;
        }
        return slow;
    }

    private ListNode twoStep(ListNode node) {
        ListNode ans;
        ans = node.next;
        if (ans.next != null) {
            ans = ans.next;
        } else {
            ans = null;
        }
        return ans;
    }

    public boolean isPalindrome_deque(ListNode head) {
        ListNode current = head;
        Deque<ListNode> queue = new LinkedList<>();
        while (current != null) {
            queue.offer(current);
            current = current.next;
        }
        while (!queue.isEmpty() && queue.size() > 1) {
            ListNode pre = queue.pollFirst();
            ListNode post = queue.pollLast();
            if (pre.val != post.val) {
                return false;
            }
        }
        return true;
    }