已解答
中等
相关标签
相关企业
提示
给你一个链表,删除链表的倒数第 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
/**
* 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;
ListNode* first = dummy;
ListNode* second = dummy;
// 将 first 指针向前移动 n+1 步
for (int i = 0; i <= n; ++i) {
first = first->next;
}
// 移动 first 和 second 指针直到 first 指针到达链表末尾
while (first) {
first = first->next;
second = second->next;
}
// 删除倒数第 n 个结点
ListNode* nodeToDelete = second->next;
second->next = second->next->next;
delete nodeToDelete;
// 返回头结点
ListNode* newHead = dummy->next;
delete dummy;
return newHead;
}
};
向前走n个点,然后使用第二个指针一起向下走,走到最后就能得到倒数第n个节点。