class Solution {

 public:

     ListNode *removeNthFromEnd(ListNode *head, int n) {

         ListNode* fake = new ListNode(-);

         fake->next = head;

         ListNode* p = fake;

         while(n >){

             p = p->next;

             n--;

         }

         ListNode* cur = fake;

         while(p->next){

             p = p->next;

             cur = cur->next;

         }

         ListNode* tmp = cur->next;

         cur->next = cur->next->next;

         delete tmp;

         return fake->next;

     }

 };