给你一个链表,删除链表的倒数第 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
首先遍历一遍链表统计出链表长度
然后可以分为三种情况
1、删除第一个结点
2、删除最后一个结点
3、删除中间结点
通过对比n与链表长度判断是第几种情况然后进行删除
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* removeNthFromEnd(struct ListNode* head, int n){
struct ListNode* List = head;
int length = 0;
while (List) {
length ++;
List = List -> next;
}
if (length == n) {
return head -> next;
}
int flag = 1;
List = head;
while (flag ++ < length - n) {
List = List -> next;
}
if (List -> next && List -> next -> next) {
List -> next = List -> next -> next;
} else if (List -> next && !List -> next -> next) {
List -> next = NULL;
}
return head;
}
LW