leetcode: 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.

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个节点，给的n都是有效的。

思路：这道题和rotate-list的题非常像。https://blog.csdn.net/Qiana_/article/details/81488907

不过rotate这道题的k有可能是超过链表长度的值，所以需要先遍历一遍链表，记录链表的长度。这道题给的n都是有效的，可以采用快慢指针的方法，让快指针先走n步，然后快慢指针再一起走，当快指针走到链表尾的时候，慢指针走到待删除节点的前一个节点。然后慢指针指向待删除节点的后一个节点，删除待删除节点即可。

AC代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    //O(n)
    ListNode *removeNthFromEnd(ListNode *head, int n) {
        if(head == NULL)
            return head;
        ListNode* newHead = new ListNode(0);
        newHead->next = head;
        head = newHead;
        ListNode* fast = head;
        ListNode* slow = head;
        //fast先走n步
        for(int i = 0;i < n;i++)
            fast = fast->next;
        while(fast->next)
        {
            fast = fast->next;
            slow = slow->next;
        }
        //此时slow在待删除节点的前一个位置
        ListNode* del = slow->next;
        slow->next = del->next;
        delete del;
        return newHead->next;
    }
};

(*^▽^*)