解题思路:
- 定义一个dummy指针;(要考虑头结点,最好是有dummy节点)
- 找到要删除的节点的前一个节点—也就是导师k+1个节点。
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
auto dummy = new ListNode(-1);
dummy->next = head;
int k = 0;
for(auto p = head; p; p = p->next) k++;
auto p = dummy;
for(int i = 1; i <= k-n; i++)
{
p = p->next;
}
p->next = p->next->next;
return dummy->next;
}
};