19. Remove Nth Node From End of List

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.

public class Solution{
	public ListNode removeNthFromEnd(ListNode head, int n) {
		ListNode start = new ListNode(0);
		ListNode slow = start;	//用来删除节点的节点
		ListNode fast = start;	//用来遍历全部节点的辅助节点
		start.next=head;
		for (int i=0; i<n; i++)
			fast=fast.next;		//拉开fast与slow的距离，使其正好是要删除节点到末节点的距离
		while(fast.next!=null){
			fast=fast.next;
			slow=slow.next;
		}						//找到了需删除的节点
		slow.next=slow.next.next;	//直接跳过要删除的节点
		return start.next;
	}
}
//算法很不错，一个新颖的解题思路

题目不难但是用的算法倒是可以好好看看。