Remove Nth Node From End of List(java实现)

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.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n)
	{
		ListNode dummy = new ListNode(0);
		dummy.next = head;
		ListNode tmp = head;
		int len = 0;
		
		while(tmp != null)
		{
		    len++;
		    tmp = tmp.next;
		}
		
		len -= n;
		tmp = dummy;
		
		while(len > 0)
		{
		    tmp = tmp.next;
		    len--;
		}
		tmp.next = tmp.next.next;
		return dummy.next;
	}
}