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 *pl=head;
while(pl){
ListNode *p=pl;
int i;
for(i=0;i<n&&p->next!=NULL;i++)
p=p->next;
if(i==n){
if(p->next==ULL)
{
pl->next = pl->next->next;
return head;
}
pl=pl->next;
}
else
{
head=head->next;
return head;
}
}
return head;
}
};