题目:
给你一个链表,删除链表的倒数第 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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路:
① 找到倒数第N个结点的前一个结点
② 删除该结点
代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* removeNthFromEnd(struct ListNode* head, int n){
//找到倒数第N个结点
struct ListNode*slow=head;
struct ListNode*fast=head;
while(n)
{
fast=fast->next;
--n;
}
if(fast==NULL)
{
return slow->next;
}
while(fast->next)
{
fast=fast->next;
slow=slow->next;
}
//删除
struct ListNode*temp=slow->next;
slow->next=slow->next->next;
temp->next=NULL;
free(temp);
return head;
}