题目
给你一个链表,删除链表的倒数第 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]
解决
/**
* 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 *revers = head;
ListNode *flow = head;
ListNode *pre = flow;
int count = n-1;
if(revers == NULL) return head;
else if(revers->next == NULL) return NULL;
else{
while(count>0 && revers->next!= NULL){
revers = revers->next;
count--;
}
if(revers->next == NULL) return head->next;
while(revers != NULL && revers->next != NULL){
pre = flow;
revers = revers->next;
flow = flow->next;
}
if(flow->next != NULL ){
flow->val = flow->next->val;
flow->next = flow->next->next;}
else{
pre->next = NULL;
}
}
return head;
}
};
总结
整个程序只遍历了链表一遍,时间复杂度O(n)