题目描述:
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.
代码:
ListNode *removeNthFromEnd(ListNode *head, int n) {
if(head == NULL || head->next == NULL)
return NULL;
ListNode * first = head;
ListNode * second = head;
for(int i = 0;i < n;i++)
first = first->next;
if(first == NULL)
return head->next;
while(first->next != NULL)
{
first = first->next;
second = second->next;
}
second->next = second->next->next;
return head;
}