给你一个链表,删除链表的倒数第 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
进阶:你能尝试使用一趟扫描实现吗?
原题链接:19. 删除链表的倒数第 N 个结点 - 力扣(LeetCode)
思路:设置一个快指针一个慢指针,间隔为N,同时移动快慢指针,当快指针移动到末尾时,慢指针指向倒数第N个结点
/**
* 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* dummy_head = new ListNode(0,head);
ListNode* front = dummy_head->next;
ListNode* slow = dummy_head;
while(n-- && front != NULL)
front = front->next;
while(front != NULL){
front = front->next;
slow = slow->next;
}
ListNode* temp = slow->next;
slow->next = slow->next->next;
delete temp;
temp = dummy_head->next;
delete dummy_head;
dummy_head = NULL;
return temp;
}
};