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.
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.
题目要求:删除一个链表中的倒数第n个节点
思路:两个指针,一个指向起始的head,一个比head多走n步。当后面的那个指针走到最后一个节点的时候,前一个指针所指的位置就是需要删除节点的先驱节点。
需要注意两个问题:
(1)移动n步后,后面的那个节点指针如果为NULL,则表示倒数第n个节点为头节点,处理方式单独
(2)在处理的过程中注意delete那个需要删除的节点
代码如下:
/**
* 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) {
//题目假定给的n一定是合法的,不存在n大于链表长度的情况
ListNode*first=head,*end=head;
for(int i=0;i<n&&end;i++)
end=end->next;
if(!end)
{
ListNode*p=head->next;
delete head;
return p;
}
while(end->next)
{
first=first->next;
end=end->next;
}
ListNode *p=first->next->next;
delete(first->next);
first->next=p;
return head;
}
};