Java 合并两个有序链表

package cookie;

public class MergeOrderedList {
    public Node Merge(Node head1, Node head2) {
        if (head1 == null)
            return head2;
        if (head2 == null)
            return head1;
        Node head = null;
        if (head1.value < head2.value) {
            head = head1;
            head1 = head1.next;
        } else {
            head = head2;
            head2 = head2.next;
        }
        Node temp = head;
        while (head1 != null && head2 != null) {
            if (head1.value < head2.value) {
                temp.next = head1;
                head1 = head1.next;
            } else {
                temp.next = head2;
                head2 = head2.next;
            }
        }
        return head;
    }
}

class Node {
    public int value;
    public Node next;
}