leetcode oj java Remove Nth Node From End of List

问题描述：

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.

解决方案： 双指针p1,p2，指针之间间隔n, 同时向后移动，当p2.next为空的时候p1.next即为要删除的节点。

代码：

<span style="font-size:18px;">public class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        if(head.next == null){
			return null;
		}else{
		ListNode p1 = head;
		ListNode tmp = p1;
		ListNode p2 = null;
		for(int i = 0; i < n; i++){
			if(tmp.next == null){
			    head = head.next;
				return head;
			}
			p2 = tmp.next;
			tmp = p2;			
		}
		
		while(p2.next !=null){
			p1 = p1.next;
			p2 = p2.next;
		}		
		p1.next = p1.next.next;
		return head;}
    }
}</span>