[leetcode]19. Remove Nth Node From End of List@Java解题报告

https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/

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-1，每次两个指针向后一步，

当后面一个指针没有后继了，前面一个指针就是要删除的节点。

package go.jacob.day817;

/**
 * 19. Remove Nth Node From End of List
 * 
 * @author jacob
 * 下面解法一和解法一思路是一样的，用多个指针来记录要删除的节点，以及要删除的前一个节点
 */
public class Demo1 {
	/*
	 * 解法一：申请两个节点
	 */
	public ListNode removeNthFromEnd(ListNode head, int n) {

		ListNode start = new ListNode(0);
		ListNode slow = start, fast = start;
		slow.next = head;

		// Move fast in front so that the gap between slow and fast becomes n
		for (int i = 1; i <= n + 1; i++) {
			fast = fast.next;
		}
		// Move fast to the end, maintaining the gap
		while (fast != null) {
			slow = slow.next;
			fast = fast.next;
		}
		// Skip the desired node
		slow.next = slow.next.next;
		return start.next;
	}

	/*
	 * 解法二：申请三个指针
	 */
	public ListNode removeNthFromEnd_1(ListNode head, int n) {
		// 申请三个指针，cur为post到结尾时，要移除的节点。pre是cur前一个节点
		ListNode pre = new ListNode(0);
		ListNode cur = head;
		ListNode post = head;
		pre.next = cur;
		// 根据n设置好cur和post的间隔
		for (int i = 1; i < n; i++) {
			post = post.next;
		}
		// 将三个节点同时向后移动，直到post为最后一个节点
		while (post.next != null) {
			pre = pre.next;
			cur = cur.next;
			post = post.next;
		}
		// 如果三个节点没有移动，说明要删除头结点
		if (pre.next == head)
			return head.next;
		pre.next = cur.next;
		return head;
	}
}