【力扣算法题】删除链表倒数第N个节点
题目介绍
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
题解
1. 暴力求长度(力扣官方解法1)
这个思路比较简单,就是先遍历获取长度,之后长度 - n就能知道要删除节点的位置
C++源码:
int getLength(ListNode* head) {
int length = 0;
while (head) {
++length;
head = head->next;
}
return length;
}
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* dummy = new ListNode(0, head);
int length = getLength(head);
ListNode* cur = dummy;
for (int i = 1; i < length - n + 1; ++i) {
cur = cur->next;
}
cur->next = cur->next->next;
ListNode* ans = dummy->next;
delete dummy;
return ans;
}
// 作者:LeetCode-Solution
// 链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/solution/shan-chu-lian-biao-de-dao-shu-di-nge-jie-dian-b-61/
2. 栈(力扣官方解法2)
这个方法还是蛮有意思的,利用栈FILO的特性,先把所有元素推进去,然后倒着取出来,第n个刚好就是要删的那个
C++源码:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* dummy = new ListNode(0, head);
stack<ListNode*> stk;
ListNode* cur = dummy;
while (cur) {
stk.push(cur);
cur = cur->next;
}
for (int i = 0; i < n; ++i) {
stk.pop();
}
ListNode* prev = stk.top();
prev->next = prev->next->next;
ListNode* ans = dummy->next;
delete dummy;
return ans;
}
// 作者:LeetCode-Solution
// 链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/solution/shan-chu-lian-biao-de-dao-shu-di-nge-jie-dian-b-61/
3. 相对静止双指针(个人解法/力扣官方解法3)
一开始先让一个指针先跑,等跑了n次以后,让另一个指针追,这样等先跑的指针跑完了,追的那个就在要删的位置前一位
(这里我不放我的源码了,当时想出来思路结果一直没写出来,后来才知道应该让跑的慢的指针初始化在头指针前面一位,不然只有2个或更少的元素时会出错)
C++源码:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* dummy = new ListNode(0, head);
ListNode* first = head;
ListNode* second = dummy;
for (int i = 0; i < n; ++i) {
first = first->next;
}
while (first) {
first = first->next;
second = second->next;
}
second->next = second->next->next;
ListNode* ans = dummy->next;
delete dummy;
return ans;
}
// 作者:LeetCode-Solution
// 链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/solution/shan-chu-lian-biao-de-dao-shu-di-nge-jie-dian-b-61/