/**
* 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* out = head;
ListNode* fast = head;
if(head==NULL)
return NULL;
for(int i=0;i<n;i++){
if(fast->next!=NULL)
fast = fast->next;
else
return head->next;
}
while(fast->next!=NULL){
fast = fast->next;
head = head->next;
}
head->next = head->next->next;
return out;
}
};
//找到倒数第k+1个数
Remove Nth Node From End of List
最新推荐文章于 2021-08-04 10:48:57 发布