题目:
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.
分析:删除链表的倒数第n个数。链表中的最后一个数,是倒数第一个数,而不是第0个数。
思路:从链表头开始遍历,每次记录下当前访问的node数;当node数大于n时,说明其前面的node都是安全的,记录下来,并将node数减一;当node数等于n且已经访问到链表尾巴时,删除这个第n个数,即可。事实上,并没有新建空间或是删除东西,只是改变了指针的指向。
(解释不清楚啊,直接看代码吧!)
代码:
ListNode* removeNthFromEnd(ListNode* head, int n) {
int times = 0;
ListNode* l1 = new ListNode(0);
ListNode* l2 = l1;
l1->next = head;
while(head)
{
times ++;
if(times > n)
{
l1 = l1 -> next;
times --;
}
if(times == n && head -> next == NULL)
{
l1->next = l1->next->next;
l1 = l1->next;
}
head = head -> next;
}
return l2->next;
}