给你一个链表,删除链表的倒数第 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
快慢指针求解,直接求出来链表长度,找到待删除结点的前驱即可。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {
struct ListNode* p = head, * q = head;
int count = 0; //记录链表长度
while (p) {
p = p->next;
count++;
}
count = count - n;
if (count == 0) { //倒数第一个时,舍去head
return head->next;
}
while (count > 1) { //q向前移动count-n-1个单位到底第count-n位,下一位即要删除的结点
q = q->next;
count--;
}
q->next = q->next->next; //删除结点
return head;
}