Remove Nth Node from End of List

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

For example,

   1->2->3->4->5  N = 2.   1->2->3->5.
Ideas:
Double pointer thought, first number of N, the head and the new pointer between the N-1 node, then the new pointer number to the tail, the head pointer followed by the number of pointers, the pointer position of the next node deleted on the line.

1ListNode *t1=head;2ListNode *t2=head;3  for(intI=0; i<n;i++)4 {5T1=t1->Next;6 }7 if(t1==NULL)8     returnHead->Next;9  while(t1->next!=NULL)Ten { OneT1=t1->Next; AT2=t2->Next;  - } -T2->next=t2->next->Next; the returnHead

Remove Nth Node from End of List