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.
Note:
Given n will always be valid.
Try to do this in one pass.

class Solution
{
  public:
    ListNode* removeNthFromEnd(ListNode* head, int n)
    {
        if (head == NULL)
            return NULL;
        ListNode dummy(-1);
        dummy.next = head;
        ListNode* slow = &dummy,*fast = &dummy;
        while (n--)
        {
            fast = fast->next;
            if (fast == NULL)
                return NULL;
        }
        while (fast->next)
        {
            slow = slow->next;
            fast = fast->next;
        }

        ListNode* tmp = slow->next;
        slow->next = slow->next->next;
        delete tmp;

        return dummy.next;


    }
};