/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
ListNode* ans=new ListNode;
ans->next=head;
ListNode* start=ans;
ListNode* end=head;
int cnt=0;
while (cnt++<n)
end=end->next;
while (end!=NULL){
start=start->next;
end=end->next;
}
start->next=start->next->next;
return ans->next;
}
};
LeetCode19. 删除链表的倒数第N个节点
最新推荐文章于 2024-07-19 19:25:43 发布