剑指 Offer II 021. 删除链表的倒数第 n 个结点
给定一个链表,删除链表的倒数第 n
个结点,并且返回链表的头结点。
示例 1:
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
示例 2:
输入:head = [1], n = 1
输出:[]
示例 3:
输入:head = [1,2], n = 1
输出:[1]
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* dummy = new ListNode(0); //哨兵节点可以避免检测空指针
dummy->next = head;
ListNode* front = head;//实际front与back的差比n多了一,因为当front==nullptr时才能停止,此时需要将慢指针前移
ListNode* back = dummy;
for(int a=0; a<n; a++)
{
front = front->next;
}
while(front!=nullptr)
{
front = front->next;
back = back->next;
}
back->next = back->next->next;
head = dummy->next; //需要将dummy释放,因此需要暂存
// 防止内存泄漏
delete dummy;
dummy = nullptr;
return head;
}
};