[Leetcode] 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$ 个节点删除。

分析

这道题的中点在于找到要删除的节点，为此我们可以使用双指针 $p1$ 和 $p2$，将 $p1$ 先向后移 $n$ 个节点，之后两个指针同时向后移，当 $p1$ 走到链表末尾时，$p2$ 就恰好指向要删除的元素。

代码

/**
 * 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 *dummy = new ListNode(-1);
        dummy->next = head;
        ListNode *p1 = dummy, *p2 = dummy;
        while (n--) p1 = p1->next;
        while (p1->next) {
            p1 = p1->next;
            p2 = p2->next;
        }
        p2->next = p2->next->next;
        return dummy->next;
    }
};