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.
使用快慢指针,快指针首先向前移动n,随后快慢指针一起向前移动,当快指针移动至链尾时,慢指针所指向的即为需要删除的节点。
public:
ListNode *removeNthFromEnd(ListNode *head, int n)
{
if (!head)
return nullptr;
ListNode new_head(-1);
new_head.next = head;
ListNode *slow = &new_head, *fast = &new_head;
for (int i = 0; i < n; i++)
fast = fast->next;
while (fast->next)
{
fast = fast->next;
slow = slow->next;
}
ListNode *to_de_deleted = slow->next;
slow->next = slow->next->next;
return new_head.next;
}