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.
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步，第二个从头开始和第一个同步走，当第一个走到链表尾的时候，第二个指针指向的节点就是应该删除的节点。最后一个指针的作用是指向要删除的节点的前一个，通过改变它的next来删除节点。

代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *removeNthFromEnd(ListNode *head, int n) {
        if(head==NULL)
            return NULL;

        //这里定义一个dummy是必要的，因为head可能被删掉
        ListNode *dummy = new ListNode(-1);
        dummy->next = head;
        ListNode *pre = dummy;
        ListNode *slow = head;
        ListNode *fast = head;

        for(int i = 0;i < n;++i){
            fast = fast->next;
        }
        while(fast!=NULL){
            pre = pre->next;
            slow = slow->next;
            fast = fast->next;
        }
        pre->next = slow->next;
        return dummy->next;
    }
};