题目链接:19.删除链表的倒数第N个节点
思路
准确的题目应该是 删除单向链表的倒数第N个元素
两次遍历
最容易想到的就是,第一次遍历统计个数,通过计算得出节点在正数第几个。然后再遍历一次找到节点和前驱节点,删除目标节点,将前驱节点连接至后继节点即可。
双指针法
- fastNode:先移动n次
- slowNode:在fastNode移动n次之后,与fastNode同步移动
通过这样的策略能够保证fastNode在指向链表末尾nullptr时,slowNode正好指向需要删除的节点。
代码
/**
* 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 * vh = new ListNode;
vh->next = head;
ListNode * fastNode = head;
ListNode * slowNode = head;
ListNode * preNode = vh;
for (int fastcnt = 0; fastcnt < n; ++fastcnt) fastNode = fastNode->next;
while (fastNode != nullptr) {
preNode = preNode->next;
fastNode = fastNode->next;
slowNode = slowNode->next;
}
preNode->next = slowNode->next;
delete slowNode;
head = vh->next;
delete vh;
return head;
}
};