合并两个有序链表
public Node mergeNode(Node node1,Node node2){
if (node1 == null) return node2;
if (node2 == null) return node1;
Node result = null;
if (node1.value <= node2.value){
result = node1;
node1 = node1.next;
}else {
result = node2;
node2 = node2.next;
}
Node tail = result;
while(node1 != null || node2 != null){
if (node2 == null || node1 != null && node1.value <= node2.value){
tail.next = node1;
tail = tail.next;
node1 = node1.next;
}else {
tail.next = node2;
tail = tail.next;
node2 = node2.next;
}
}
return result;
}
public static void main(String[] args) {
Test t = new Test();
Node a1 = new Node(1);
Node a2 = new Node(2);
Node a3 = new Node(3);
Node a4 = new Node(4);
Node a5 = new Node(5);
a1.next = a2;
a2.next = a3;
a3.next = a4;
a4.next = a5;
Node b1 = new Node(1);
Node b2 = new Node(2);
Node b3 = new Node(3);
Node b4 = new Node(4);
Node b5 = new Node(5);
b1.next = b2;
b2.next = b3;
b3.next = b4;
b4.next = b5;
Node result = t.mergeNode(a1,b1);
}