删除链表倒数第N个元素

Given a linked list, remove the n^th 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.

Solutions：

两遍遍历的：

c

lass Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
		if(head==NULL)
			return head;
        ListNode *iters=head;
		int lengthOfList=0;
		for( ; iters!=NULL; iters=iters->next) {
			lengthOfList++;
		}
		int i=0;
		ListNode* prev=head;
		for(iters=head ; iters!=NULL && i<lengthOfList-n; ++i) {
			prev=iters;
			iters=iters->next;
		}
		if(iters == head) {
			head=head->next;
		}
		else {		
			prev->next=iters->next;
			//iters->next=temp->next;
		}
		return head;
    }
};

一遍遍历：可以用两个指针，两者距离为n，则第二个到末尾时，第一个所指位置即为所要删除的。

class Solution {
public:
	ListNode* removeNthFromEnd(ListNode* head, int n) {
		if(head == NULL)
			return head;
		ListNode *iter1, *iter2;
		int i=0;
		for(iter2=head; i<n; ++i) {
			iter2=iter2->next;
		}
		if(iter2==NULL){
			iter1=head;
			head=head->next;
			delete iter1;
			return head;
		}
		for(iter1=head; iter2->next; iter1=iter1->next, iter2=iter2->next);
		iter2=iter1->next;
		iter1->next=iter2->next;
		delete iter2;
		return head;
	}
};