/**
 * Definition of ListNode
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 *     ListNode(int val) {
 *         this->val = val;
 *         this->next = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param head: The first node of linked list.
     * @param n: An integer.
     * @return: The head of linked list.
     */
    ListNode *removeNthFromEnd(ListNode *head, int n) {
        // write your code here
        if(head==NULL)
        return 0;
        if(head->next==NULL&&n==1)
        return 0;
        ListNode *p1=head;
        ListNode *p2=NULL;
        ListNode *pre=NULL;
        for(int i=0;i<n-1;i++)
        {
            if(p1->next!=NULL)
            {
                p1=p1->next;
            }
            else
              return NULL;
        }
        p2=head;
        while(p1->next!=NULL)
        {
            p1=p1->next;
            pre=p2;
            p2=p2->next;
        }
        if(p2->next==NULL)
        {
            pre->next=NULL;
            delete p2;
            p2=NULL;
        }
        else
        {
            ListNode *p3=p2->next;
            p2->val=p3->val;
            p2->next=p3->next;
            delete p3;
            p3=NULL;
        }
        return head;
    }
};