两个有序链表进行合并,两个链表进行一一比较,小的放入新的链表中,最后那个链表还剩数据,就全部导入进去。
package train;
public class 有序拼接链表 {
public class Node {
public Node next;
public int value;
public Node (int data){
this.value = data;
}
}
public Node megerList (Node head1, Node head2) {
if (head1==null){
return head2;
}
Node head3 = null;
head1=head1.next;
while(head1.next!=null||head2.next!=null){
if (head1.value>head2.value){
head3= head2;
head2 = head2.next;
head3 =head3.next;
}
else {
head3= head1;
head1 = head1.next;
}
}
while(head1.next!=null){
head3 =head1;
head1 = head1.next;
head3 =head3.next;
}
while(head2.next!=null){
head3 =head2;
head2 = head2.next;
head3 =head3.next;
}
return head3;
}
}