Remove Nth Node From End of List.txt

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        ListNode* root = new ListNode(0);
        ListNode* tail = root, *prev = root;
        root->next = head;
        while(n--)
            tail = tail->next;
        while (tail->next != NULL) {
            tail = tail->next;
            prev = prev->next;
        }
        ListNode* temp = prev->next;
        prev->next = temp->next;
        delete temp;
        head = root->next;
        delete root;
        return head;
    }
};