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 *ptrNode=head;
int size=0;
while(ptrNode!=NULL)
{
size++;
ptrNode=ptrNode->next;
}
if(size<=1)
return NULL;
int index=size-n+1;
ptrNode=head;
if(index==1)
head=ptrNode->next;
else
{
for(int i=1;i<=index-2;i++)
{
ptrNode=ptrNode->next;
}
ptrNode->next=ptrNode->next->next;
}
return head;
}
};