19. 删除链表的倒数第 N 个结点
题目链接
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题目描述
题目分析
快慢指针也可以借助dummy。
/**
* 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);
dummy->next = head;
//找到倒数第n+1个节点
ListNode* slow = dummy;
ListNode* fast = dummy;
for(int i = 1; i <= n + 1; i++){
fast = fast->next;
}
while(fast){
fast = fast->next;
slow = slow->next;
}
//此时slow指向倒数第n+1个节点
slow->next = slow->next->next;
return dummy->next;
}
};