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步
//
// start: remove the nth node from the end of list
ListNode *removeNthFromEnd(ListNode *head, int n)
{
if(n <= 0 || !head)
return head;
ListNode *ahead = head, *behind = head;
for(int i = 0; i < n; i++)
ahead = ahead->next; // ahead n
while(ahead->next)
{
ahead = ahead->next;
behind = behind->next;
}
// delete node behind->next
ListNode *tmp = behind->next;
behind->next = p->next->next;
delete tmp;
return head;
}
// end
//