链表、双指针。主要是删除头结点情况的考虑。
/**
* 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) {
int i=1;
ListNode *p=new ListNode(), *q=head;
p->next = head;
while(q->next!=nullptr){
q=q->next;
i++;
if(i>n){
p=p->next;
}
}
// cout << p->val << " " << p->next->next << endl;
if(p->next == head){// p没动
head = head->next;
}
p->next = p->next->next;
return head;
}
};