Remove Nth Node From End of List

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

For 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.
Try to do this in one pass.

在一次循环中找到链表的倒数第N个节点，并且删除它，然后返回修改后的链表。

找到倒数第N个节点的方法是，创建两个指针left和right，left指向链表头，right指向left右边第N个节点，然后将两个指针以此后移，当right指针指向链表尾时，left指针指向的是倒数第N个节点；这里需要删除第N个节点，因此要找到倒数第N+1个节点，又考虑到可能要删除头结点，因此在头结点前再增加一个节点。代码如下：

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode pre = new ListNode(0), left = pre, right = pre;
        pre.next = head;
        while(n-- > 0)
            right = right.next;
        while(right.next != null){
            left = left.next;
            right = right.next;
        }
        left.next = left.next.next;
        return pre.next;
    }
}