题目描述
思路分析
链表模拟
代码实现
/**
* 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 k) {
auto dummy=new ListNode(-1);
dummy->next=head;
int n=0;
for(auto p=dummy;p;p=p->next) n++;
auto p=dummy;
for(int i=0;i<n-k-1;i++) p=p->next;
p->next=p->next->next;
return dummy->next;
}
};