[Leetcode 19] Remove Nth Node from End of List

1 topics

Given A linked list, remove the nth node from the end of the list and return its head.

For example,

   n = 2.   After removing the second node from the end, the linked list becomes 1->2->3->5.

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

2 Ideas

The topic requires traversal to be done, then, you can use two pointers, the first one to go forward first N, and then go together, finally, remove the latter element. Do it by yourself.

3 Code

         PublicListNode Removenthfromend (ListNode head,intN) {listnode node=Head;  while(N>0 && node!=NULL) {node=Node.next; N--; } ListNode Start=Head; if(Node! =NULL){                 while(Node.next! =NULL) {node=Node.next; Start=Start.next; }            }Else{                /*Would remove the first object*/Start=Start.next; returnstart; } Start.next=Start.next.next; returnHead; }

[Leetcode 19] Remove Nth Node from End of List