给你一个链表,删除链表的倒数第 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]
提示:
链表中结点的数目为 sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/remove-nth-node-from-end-of-list
思路:
1. 定义一个 dumpy 节点,dumpy->next = head (当要删除的节点是头节点时,返回 dumpy->next 即可)
2. 定义两个节点,fast 与 slow,两者都从 dumpy 开始,fast先走 n 步骤。然后 fast 与 slow 同时往下走,直到 fast 走到尾节点为止,此时删除 slow节点的下一个节点即为题目所求
3. 返回 dumpy->next
c++:
/**
* 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 dumpy = ListNode();
ListNode* dumpyptr = &dumpy;
dumpyptr->next = head;
auto slow = dumpyptr;
auto fast = dumpyptr;
int i = 0;
while(i < n) {
slow = slow->next;
i++;
}
while(slow->next != nullptr) {
slow = slow->next;
fast = fast->next;
}
fast->next = fast->next->next;
return dumpyptr->next;
}
};