LeetCode19 - 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.

【思路】

题目保证n的值都是合法的，那么定义两个指针类型节点，两者之间相差n个元素，当前者为null时，后者的当前节点，即为需要跳过的节点

【Java代码】

public class Solution_19_remove_nth_node_from_end_of_list {
	public ListNode removeNthFromEnd(ListNode head,int n){
		ListNode p = head,e = head;
		ListNode result = new ListNode(0);
		ListNode s = result;
		for(int i = 0 ; i < n ; i++)
			e = e.next;
		while(e != null){
			e = e.next;
			ListNode curr = new ListNode(p.val);
			curr.next = null;
			s.next = curr;
			s = s.next;
			p = p.next;
		}
		p = p.next;
		s.next = p;
		result = result.next;
		return result;
	}
}