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.
pro:将链表中的倒数第N个节点删除。
sol:fast slow指针
code:
class Solution {
public:
ListNode *removeNthFromEnd(ListNode *head, int n) {
int i;
ListNode *fast = head;
ListNode *root = new ListNode(0);
root->next = head;
for(i=0;i<n-1;i++)
fast = fast->next;
ListNode *pre,*cur;
pre = root;
cur = head;
while(fast->next!=NULL)
{
fast = fast->next;
pre = cur;
cur = cur->next;
}
pre->next = cur->next;
return root->next;
}
};