/**
* 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) {
if(head == nullptr){
return head;
}
int lSize = 1;
ListNode* p = head;
// 链表长度
while(p->next){
lSize++;
p = p->next;
}
// 寻找哪个合适的节点
int nice = lSize - n;
if(nice == 0){
// 是第一个节点
p = head;
head = head->next;
return head;
}
// 不是第一个节点,找到合适的p节点
ListNode* pre = head;
p = pre->next;
nice--;
while(nice--){
pre = p;
p = pre->next;
}
// 删除p
pre->next = p->next;
return head;
}
};