[leetcode] 19.Remove Nth Node From End of List

Given a linked list, remove the n-th node from the end of list and return its head.

Example:

Given linked list: 1->2->3->4->5, and n = 2.

After removing the second node from the end, the linked list becomes 1->2->3->5.
Note:

Given n will always be valid.

Follow up:

Could you do this in one pass?

题目：倒序查找链表第n个节点，要求程序对链表只做one pass。

我想到的思路是遍历一遍链表，遍历时用数组把每个节点存起来，然后直接在数组里找到倒数第N个节点删除。这样做空间复杂度O(n)。
看别人的程序，发现了一种空间复杂度O(1)的方法，在此记录下来。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode lead = head;
        for (int i = 0; i < n; i += 1) {
            lead = lead.next;
        }
        ListNode deleter = head;
        if (lead == null) {
            return deleter.next;
        }
        while (true) {
            if (lead.next == null) {
                deleter.next = deleter.next.next;
                return head;
            }
            lead = lead.next;
            deleter = deleter.next;
        }
    }
}

感觉非常巧妙，先找到正序第n个节点，再在head处放第二个指针，然后两个指针一起动，当第一个指针到底的时候，第二个指针刚好指向要删除的节点前一个上。