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.

Follow up:

Could you do this in one pass?

这道题提交之后老是会遇到null pointer的问题，因为删除 l1后面的那个节点，那就是 l1->next = l1->next ->next;如果l1->next是个空的，那么就会越界。

我放别人的代码是因为他们都比我写的好～～

解决问题的方法

1）就是在前面加个虚节点咯。我发现自己好懒，我根本就不想去写-  -

2）我看到讨论区很聪明的方法就是直接把下个节点的内容拷贝到这个节点。我觉得很聪明

第一个方法的话代码：

ListNode *removeNthFromEnd(ListNode *head, int n) 
{
    if (!head)
        return nullptr;

    ListNode new_head(-1);
    new_head.next = head; //加了个虚节点

    ListNode *slow = &new_head, *fast = &new_head;

    for (int i = 0; i < n; i++)
        fast = fast->next;

    while (fast->next) 
    {
        fast = fast->next;
        slow = slow->next;
    }

    ListNode *to_de_deleted = slow->next;
    slow->next = slow->next->next;
    
    delete to_be_deleted;

    return new_head.next; //返回虚节点的next
}

第二个方法的代码：

 ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode** l1 = &head, * l2 = head;

        for(int i = 1; i < n; i++)
            l2 = l2->next;
        
        while(l2 -> next != NULL){
            l1 = &((*l1)->next);
            l2 = l2->next;
        }
        *l1 = (*l1)->next;
        return head;
    }