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

Description:

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.

————————————————————————————————————————————————————————————————————————————

Solution:

第一想法是：遍历一遍链表得到链表的长度L，再从头遍历到达第L-n个节点，将该节点next指针指向next的next即可。

然而题目示意我们只遍历一遍，参考Solution后发现有个小细节：链表尾部离第L-n个节点只有n个距离，于是可以设置两个指针，第一个指针从头节点开始向尾部移n+1个节点，第二个指针指向头节点，然后两个指针同时移动，这样只要第一个指针到达尾部，那么第二个指针也就同时到达目的节点的上一个节点，也就是第L-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 *ptr = new ListNode(-1);
        ptr->next = head;
        head = ptr;
        ListNode *ptr2 = ptr;
        
        int dist = n + 1;
        while (dist--) {
            ptr2 = ptr2->next;
        }
        
        while (ptr2 != NULL) {
            ptr = ptr->next;
            ptr2 = ptr2->next;
        }
        
        ptr->next = ptr->next->next;
        
        return head->next;
    }
};