/**
* 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:
int getlength(ListNode* head)
{
int lenght =0;
while(head)
{
++lenght;
head=head->next;
}
return lenght;
}
ListNode* removeNthFromEnd(ListNode* head, int n) {
//哑节点,因为从1开始遍历,所以前面要加一个哑节点
ListNode* dummy=new ListNode(0,head);
int l =getlength(head);
ListNode * cur =dummy;
for(int i=1;i<l-n+1;i++)
{
cur=cur->next;
}
//跳过删除的那个
cur->next=cur->next->next;
ListNode*ans =dummy->next;
//删除哑节点
delete dummy;
return ans;
}
};
19. 删除链表的倒数第 N 个结点
于 2022-09-26 20:26:53 首次发布