public boolean isPail (ListNode head) { ListNode pre = head, cur = head; //求中点并进行反转后对比 while (cur != null && cur.next != null) { cur = cur.next.next; pre = pre.next; } ListNode newHead = reverse(pre, cur); return isSame(head, newHead); } //翻转链表 private ListNode reverse(ListNode head, ListNod...