链表 234. 回文链表

回文链表思路很简单

把链表倒序一下，比较就ok了

倒序记得要新建node

public static boolean isPalindrome(ListNode head) {
        ListNode head2 = head;
        ListNode head3 = null;
        int length = 0;
<pre><code>    while (head2 != null) {
        head3 = new ListNode(head2.val, head3);
        head2 = head2.next;
        length++;
    }

    for (int i = 0; i &lt; length/2; i++) {
       if (head.val != head3.val) {
           return false;
       }
        head = head.next;
        head3 = head3.next;
    }
    return true;
}

leetCode上有大佬用快慢指针加反转，也是比较厉害了

反转链表实现