双指针
一次遍历
/**
* 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=new ListNode(-1);
dummy->next=head;
ListNode* fast=dummy;
ListNode* slow=dummy;
while(n-- && fast!=nullptr)
fast=fast->next;
while(fast->next)//没必要走到null才停,走到最后一个节点也可以
{
fast=fast->next;
slow=slow->next;
}
slow->next=slow->next->next;
return dummy->next;
}
};
两次遍历:
第一次遍历求链表size()
/**
* 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=new ListNode(-1);//感觉虚拟头节点真的可
dummy->next=head;
ListNode* it=dummy;
int cnt=0;
while(it->next)
{
it=it->next;
cnt++;
}
if(cnt==n)return head->next;
it=dummy;
for(int i=1;i<=(cnt-n);i++)
it=it->next;
it->next=it->next->next;
return dummy->next;
}
};