数据结构与算法（三）——两个有序的链表合并

public class Demo {

	public static void main(String[] args) {

		// 两个有序的链表合并
		Node node1 = getNode(6);
		System.out.println("-------------node1--------------");
		print(node1);
		Node node2 = getNode(6);
		System.out.println("-------------node2--------------");
		print(node2);
		Node merge = merge(node1, node2);
		System.out.println("-------------合并后--------------");
		print(merge);
	}

	// 求中间结点
	public static Node findMiddleNode(Node list) {
		if (list == null)
			return null;
		Node fast = list;
		Node slow = list;
		while (fast.next != null && fast.next.next != null) {
			fast = fast.next.next;
			slow = slow.next;
		}
		return slow;
	}

	// 两个有序的链表合并
	private static Node merge(Node node1, Node node2) {
		Node head = new Node(-1);
		Node p = head;
		while (node1 != null && node2 != null) {
			if (node1.value <= node2.value) {
				p.next = node1;
				node1 = node1.next;
			} else {
				p.next = node2;
				node2 = node2.next;
			}
			p = p.next;
		}
		if (node1 != null) {
			p.next = node1;
		}
		if (node2 != null) {
			p.next = node2;
		}
		return head.next;
	}

	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;
		}
	}
}