从零开始的LC刷题(120): Remove Nth Node From End of List 移除链表中倒数第n个元素

原题：

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?

很简单的一道题，要求遍历一次链表移除倒数第n个节点，设置三个指针tillend，target，tail，tillend先跑n个节点，然后target和tillend一起向后移动，tail指向target前一个节点，直到tillend到了链表末尾，删除target就行，结果：

Success

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Remove Nth Node From End of List.

Memory Usage: 8.4 MB, less than 98.68% of C++ online submissions for Remove Nth Node From End of List.

代码：

/**
 * 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* tillend=head;
        ListNode* target;
        ListNode* tail;
        while(n>0){tillend=tillend->next;n--;}
        if(tillend==nullptr){head=head->next;return head;}
        target=head;
        while(tillend!=nullptr){tillend=tillend->next;tail=target;target=target->next;}
        tail->next=target->next;
        delete(target);
        return head;
    }
};