LeetCode - Remove Nth Node From End of List

Given a linked list, remove the n^th 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.

/**
 * 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) {
        if(head==NULL){
			return head;
		}
	
		ListNode *p=head,*q=head;
		int counter=0;

		while(q&&counter<n){//循环直到q指向正数第n+1个结点
			q=q->next;
			counter++;
		}
		if(q==NULL){//q恰好走完整个链表
			if(counter==n){//需要删除的是头节点
				head=head->next;
			}
			return head;
		}
		while(q->next){//循环直到q指向尾结点，p恰好指向倒数第n+1个结点
			p=p->next;	
			q=q->next;
		}
	
		q=p->next;//删除倒数第n个结点（该结点可能是尾结点）
		p->next=q->next;

		return head;
    }
};