数据结构与算法（四）——删除倒数第K个结点

public class Demo {

	public static void main(String[] args) {
		// 删除链表倒数第 n 个结点
		Node node = getNode(7);
		Node deleteLastKth = deleteLastKth(node, 6);
		print(deleteLastKth);

	}

	/*
	 * 删除倒数第K个结点
	 * 思路：
	 * - 第一次遍历：fast定位到k之后的节点
	 * - 第二次遍历：show和fast，同时从fast节点开始往后移
	 */
	private static Node deleteLastKth(Node node, int k) {
		Node fast = node;
		int i = 1;// fast已经赋值了
		while (fast != null && i < k) {
			fast = fast.next;
			++i;
		}
		if (fast == null) {
			return node;
		}
		Node p = null;
		Node show = node;
		while (fast.next != null) {
			fast = fast.next;
			p = show;
			show = show.next;
		}
		if (p == null) {
			// 如果刚刚有k个节点
			return node.next;
		} else {
			p.next = p.next.next;
		}
		return node;
	}

	// 获取普通链表
	private static Node getNode(Integer n) {
		Node node = null;
		Node head = null;
		for (int i = 1; i <= n; i++) {
			Node next = new Node(i);
			if (node == null) {
				node = next;
				head = next;
			} else {
				node.next = next;
				node = next;
			}
		}
		return head;
	}

	private static void print(Node node) {
		StringBuilder s = new StringBuilder();
		while (node != null) {
			if (s.length() == 0) {
				s.append(node.value);
			} else {
				s.append(" --> " + node.value);
			}
			node = node.next;
		}
		System.out.println(s.toString());
	}

	static class Node {
		public Node next;
		public Integer value;

		public Node(Integer value) {
			this.value = value;
		}
	}
}