LeetCode 19 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个元素。

解题思路：第一步，通过一次遍历找到要删除的结点 。方法是设置两个指针P1和P2，初始时P1和P2都指向head。然后移动N - 1次P2到正数第N个结点，再同时移动P1和P2，直到P2到达最后一个结点，此时P1指向倒数第N个结点。第二步是删除P1所指的结点，这一步可以通过将P1设置为二级指针来完成。具体请看代码实现。

代码如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {
    
    struct ListNode** ppHead = &head;
    struct ListNode* pHead = head;
    
    for(int i = 1;i < n;i++){
        pHead = pHead->next;
    }
    while(pHead->next){ 
        ppHead = &((*ppHead)->next);
        pHead = pHead->next;
    }
    struct ListNode* tmp = *ppHead;
    free(tmp);
    *ppHead = (*ppHead)->next;
    return head;
}