19.LeetCode 删除链表的倒数第N个节点(快慢指针)
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode *dummy=new ListNode(0);
ListNode *slow=dummy,*fast=dummy;
dummy->next=head;
for(int i=0;i<n;i++){
fast=fast->next;
}
while(fast->next){ //当fast有下一个节点时,快,慢节点不断向后移动
slow=slow->next;
fast=fast->next;
}
slow->next=slow->next->next; //删除慢节点后面的的节点,即链表的倒数第n个节点
return dummy->next;
}
};