19. Remove Nth Node From End of List
Medium
1592124FavoriteShare
Given a linked list, remove the n-th node from the end of list and return its head.
Example:
Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5.
Note:
Given n will always be valid.
Follow up:
Could you do this in one pass?
这道题是看了答案后写出来的。有一个地方比较难理解,就是为什么要加这一句:if(fast==NULL)return head->next;
如果不加的话,会有这样的testcase不通过:[1],1 这个testcase正确的返回值应该是[]。还有一个需要注意的地方, while(fast->next!=NULL)这里的判断条件是下一个不为空,而不是fast不为空。不然会删除到指定位置的下一个数字。
/**
* 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* fast=head;
ListNode* slow=head;
ListNode* dummy=slow;
// dummy->next=slow;
while(n>0)
{
fast=fast->next;
n--;
}
if(fast==NULL)return head->next;
while(fast->next!=NULL)
{
slow=slow->next;
fast=fast->next;
}
slow->next=slow->next->next;
return dummy;
}
};