给你一个链表,删除链表的倒数第 n
个结点,并且返回链表的头结点。
示例 1:
输入:head = [1,2,3,4,5], n = 2 输出:[1,2,3,5]
示例 2:
输入:head = [1], n = 1 输出:[]
示例 3:
输入:head = [1,2], n = 1 输出:[1]
提示:
- 链表中结点的数目为
sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz
代码:
struct ListNode* removeNthFromEnd(struct ListNode* head, int n){
struct ListNode* slow=head;
struct ListNode* fast=head;
for(int i=0;i<n;i++)
{
fast=fast->next;
}
while(fast!=NULL&&fast->next!=NULL)
{
slow=slow->next;
fast=fast->next;
}
if(fast==NULL)return head->next;
else slow->next=(slow->next)->next;
return head;
}