[LeetCode 19] 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-1个节点的距离，这样当遍历到最后一个节点时，就可以记录要删除的节点和它的前一个节点。

中午阿里电面的表现简直成渣，下午心情不太好~

/**
 * 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) {
        ListNode *pre,*node,*next;
        pre=head;next=head;node=head;
        while(--n)
        {
            node=node->next;
           
        }
        while(node->next)
        {
            node=node->next;
            pre=next;
            next=next->next;
        }
        if(next==head)
        {
            head=next->next;
            delete(next);
        }
        else
        {
            pre->next=next->next;
            delete(next);
        }
        return head;
    }
};