给你一个链表,删除链表的倒数第 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]
解析:要注意两个点:
- 链表为1,则返回0;
- 链表删除的节点为head,所以必须要用一个新的前导节点拼接在原链表开头,用来指示删除head后的新head。
/**
* 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:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* pre = new ListNode(0, head);
ListNode* cur = head;
int length = 0;
while (cur) {
length++;
cur = cur->next;
}
if (length == 1)
return nullptr;
cur = pre;
int index = length - n;
while (index > 0) {
cur = cur->next;
index--;
}
cur->next = cur->next->next;
cur = pre->next;
delete pre;
return cur;
}
};