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.

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.

题目大体意思为 给出一个链表 删除倒数第n个数
这里给出时间复杂度O(l);
通过遍历一遍 这里我们设置快慢指针 一个从起始点开始 一个从第n个数开始

ListNode* p1 = head; ListNode* p2 = head;
    while(n)
    {
        n--;
        p1 = p1-> next;
    }
        if(p1==NULL)
            return p2->next;
    while(p1->next != NULL)
    {
        p1= p1 ->next;
        p2= p2 ->next;
    }
    p2->next = p2->next->next;
    return head;