Remove Nth Node From End of List

一、题目要求

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

For example,
   Given linked list: 1->2->3->4->5, and n = 2.
   After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:
Given n will always be valid.
Try to do this in one pass.

二、代码实现

ListNode* removeNthFromEnd(ListNode* head, int n) {
       if(head==NULL || n<=0)   
		 return head;
	 //
	 ListNode* first=head,*second=head;
	 while(n--)
	 {
		 first=first->next;
	 }
	  if(first==NULL)
	 {
		 if(head->next==NULL)
			 return NULL;
		 else
		 {
			 head=head->next;
			return head;
		 }
	     
	 }
	  while(first->next!=NULL)
	 {
		 first=first->next;
		 second=second->next;
	 }

	 second->next=second->next->next;

	 return head;
    }