(java)leetcode-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.

解题思路：

我的想法就是，要找到倒数第n个node嘛，所以先找到第n个node，记录第0个和第n个node（记为p1，p2），然后这两个node不断地指向他们的next直到p2的next为null，此时p1就是就是倒数第n-1个node，这个时候直到让p1.next = p1.next.next就可以完成任务了。所以还是比较简单的。

/**
 * 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 first = new ListNode(0);
		first.next = head;
		ListNode p1 = first;
		ListNode p2 = first;
		int k = 0;
		while(k<n)
		{
			if(p2.next == null)
				return head;
			p2 = p2.next;
			k++;
		}
		while(true)
		{
			if(p2.next == null)
			{
				p1.next = p1.next.next;
				break;
			}
			p1 = p1.next;
			p2 = p2.next;
		}
		return first.next;
    }
}