题目: 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.
双指针标记法,前后指针相隔n-1.
以指向下一个指针是为NULL为判断标志,每次两个指针向后一步,当后面一个指针没有后继了,前面一个指针的下一个节点就是要删除的节点。
当到最后一个时,后面指针的下一个就是要删除的指针,直接用second->next=second->next->next就可以删除。
记得对删除节点进行空间释放。
代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* removeNthFromEnd(struct ListNode* head, int n) {
struct ListNode* first=head;
struct ListNode* second=NULL;
int number=0;
if(head==NULL)
{
return NULL;
}
while(first->next!=NULL)
{
number++;
first=first->next;
if(number==n)
{
second=head;
}
printf("The number is %d",number);
if(number>n)
{
second=second->next;
}
}
if(second==NULL )
{
struct ListNode* t=head;
head=head->next;
free(t);
}
else
{
struct ListNode* t=second->next;
second->next=second->next->next;
free(t);
}
return head;
}