[LeetCode] Remove Nth Node From End of List

/**
 * 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 *tail = head;
        
        for (int i = 0; i < n; i++)
            tail = tail->next;
        
        if (!tail) return head->next;
        
        ListNode *node = head;
        
        while (tail->next) {
            tail = tail->next;
            node = node->next;
        }
        
        node->next = node->next->next;
        
        return head;
    }
};

Small Case: 4ms

Large Case: 32ms

Time: O(n)

Space: O(1)