leetcode19

class Solution {
public:
    int N = 0;
    int LEN = 0;

    ListNode* removeNthFromEnd(ListNode* head, int n) {
        int i = 0;
        ListNode* node = head;
        N++;
        LEN = max(LEN, N);
        if (node->next != NULL)
        {            
            ListNode* Next = removeNthFromEnd(node->next, n);
            N--;
            if (n == LEN - N)
            {
                node->next = Next->next;
            }
        }
        if (n == LEN)
        {
            return head->next;
        }
        return node;
    }
};