Deletes the nth node starting at the end of the list

Source: Internet
Author: User

Given A linked list, remove the nth node from the end of the 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.

Given n would always be valid.
Try to do the in one pass.

def removenthfromend (Head,n):     counter=0    ptr=head    lagptr=head     while ptr!=None:         if counter>n:           counter+=1     if counter-n>0:        return head    if  counter==n:        return     Else:        return none 

Deletes the nth node starting at the end of the list

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.