Given a linked list, remove the n-th node from the end of list and return its head.
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.
Follow up:
Could you do this in one pass?
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {
if(n<=0||head==NULL)
return head;
struct ListNode *p,*q,*hhead;
hhead=(struct ListNode *)malloc(sizeof(struct ListNode));
int i;
hhead->next=head;
p=hhead; q=hhead;
for(i=0;i<n;i++)
p=p->next;
while(p->next!=NULL)
{
p=p->next;
q=q->next;
}
q->next=q->next->next;
return hhead->next;
}