"Data Structure" algorithm linklist (Remove Nth Node from End of List)

Delete the nth node in the linked list

Time complexity to be controlled in O (n)
Solution:
Set 2 pointers, one for determining the location of the deleted node, and one for calculating the reciprocal spacing N. Keep 2 pointers moving while moving.

  PublicListNode Removenthfromend (ListNode head,intN) {if(head==NULL)return NULL; ListNode Pre=Head; ListNode cur=Head;  for(inti=0;i<n;++i) {cur=Cur.next; if(cur==NULL)            {                returnHead.next; }        }         while(cur.next!=NULL) {cur=Cur.next; Pre=Pre.next; } Pre.next=Pre.next.next; returnHead; }

"Data Structure" algorithm linklist (Remove Nth Node from End of List)