LeetCode算法题目：Remove Nth Node From End of List

题目：

Given a linked list, remove the nth 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.

---

分析：

双指针思想，两个指针相隔n-1，每次两个指针向后一步，当后面一个指针没有后继了，前面一个指针就是要删除的节点。

---

代码：

/**
 * 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 realHead(0);
        realHead.next = head;
        head = &realHead;
        ListNode *curr = &realHead;
        while (n-- > 0)
            curr = curr->next;
        while (curr->next != nullptr) {
            curr = curr->next;
            head = head->next;
        }

        head->next = head->next->next;
        return realHead.next;
    }
};