19. Remove Nth Node From End of List

Problem

19. Remove Nth Node From End of List

Question

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.

Note:
Given n will always be valid.
Try to do this in one pass.

思路

递归扫一遍就行了

Code

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    int target;
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        target = n;
        int count = 0;
        ListNode *nullNode = NULL;
        remove(head, nullNode, count);
        return head;
    }
    void remove(ListNode* &currentNode, ListNode* &lastNode, int &count) {
        if (currentNode != NULL) {
            int temp = ++count;
            cout << temp << endl;
            remove(currentNode->next, currentNode, count);
            if (temp == count - target + 1) {
                if (lastNode != NULL)
                    lastNode->next = currentNode->next;
                else currentNode = currentNode->next;
            }
        }
    }
};