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.
/**
* 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) {
ListNode *pPre=NULL;
ListNode *p=head;
ListNode *q=head;
if (head == NULL) return NULL;
int i=0;
while(i<n-1){
q=q->next;
i++;
}
while(q->next){
pPre=p;
p=p->next;
q=q->next;
}
if (pPre == NULL){
head = p->next;
delete p;
}else{
pPre->next=p->next;
delete p;
}
return head;
}
};