19. 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.
 *
 */

public class RemoveNthNodeFromEndOfList {
	public class ListNode {
		int val;
		ListNode next;
		ListNode(int x) {
			val = x;
			next = null;
		}
	}
//	207 / 207 test cases passed.
//	Status: Accepted
//	Runtime: 225 ms
//	Submitted: 0 minutes ago
	
	/**
	 * 
	 * 分析：
	 * 设置两个游标，after先走n步，然后before和after一起走，after走到尽头，然后再删除before.next
	 * 
	 */
	
    public ListNode removeNthFromEnd(ListNode head, int n) {
        if(head == null || n == 0) return head;
        ListNode before = head;
        ListNode after = head;
    	for (int i = 0; i < n; i++) {
    		if(after.next != null)
    			after = after.next;
    		else 
    			return head.next;
		}
    	while(after.next != null) {
    		before = before.next;
    		after = after.next;
    	}
    	before.next = before.next.next;
    	return head;
    }
	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}