19 Remove Nth Node From End of List
链接:https://leetcode.com/problems/remove-nth-node-from-end-of-list/
问题描述:
Given a linked list, remove the nth node from the end of list and return its head.
For 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.
Try to do this in one pass.
Hide Tags Linked List Two Pointers
找到最后第n个节点,删除就可以了,需注意的问题是别忘记了删除内存。
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* head, int n) {
if(head==NULL)
return head;
ListNode *t=new ListNode(0),*p1=t,*p2=head;
p1->next=head;
for(int i=0;i<n;i++)
p2=p2->next;
while(p2)
{
p2=p2->next;
p1=p1->next;
}
p2=p1->next;
p1->next=p2->next;
head=t->next;
delete p2;
delete t;
return head;
}
};