class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* p = new ListNode(0);
ListNode* L2 = new ListNode(0);
p->next = head; //需要考虑到头结点
L2->next = head;
if(head == NULL || n < 1)
return NULL;
while(n--)
L2 = L2->next;
if(L2->next == NULL) //是头结点的话
return head->next;
else
{
while(L2->next != NULL)
{
L2 = L2->next;
p = p->next;
}
}
p->next = p->next->next;
return head;
}
};
Remove Nth Node From End of List
最新推荐文章于 2021-08-04 10:48:57 发布