public static ListNode removeNthFromEnd (ListNode head, int n) { if (getLength(head) == n){ head = head.next; return head; } ListNode p = head, q = head; int i = 0; // 找出前后两个游标之间的距离 == n,然后连个游标不断往后移动,直到后面的游标的next为null停止 while...