LeetCode 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 (NULL == head)
			return NULL;

		ListNode *pfast = head;
		ListNode *pslow = head;
		int i = 0;

		for (i = 0; i < n; i++) {
			pfast = pfast->next;
		}

		if (NULL == pfast) {
			head = head->next;
			delete pslow;
			return head;
		}

		while (pfast->next != NULL) {
			pfast = pfast->next;
			pslow = pslow->next;
		}
		
		ListNode *ptemp = pslow->next; 
		pslow->next = ptemp->next; 
		delete ptemp;

		return head;
	}
};