独立完成,很开心
解法:先创建一个合并后的链表tlist,创建一个节点cur指向这个链表list,
再分别用两个节点temp1,temp2指向这两个传过来的有序链表
用while循环,只要两个链表中有任意一个为空,就跳出循环
循环中将小的节点加入list,然后再更改list的next和temp的next往下指
跳出循环后判断谁有剩余就挂到list后面,输出
代码如下
public static void towList(heroNode node1,heroNode node2){
heroNode list = new heroNode();
heroNode cur = list.next;
heroNode temp1 = node1.next;
heroNode temp2 = node2.next;
while (temp1 != null && temp2 != null){
if (temp1.no <= temp2.no){
list.next = temp1;
list = list.next;
temp1 = temp1.next;
} else {
list.next = temp2;
list = list.next;
temp2 = temp2.next;
}
}
list.next = (temp1!= null ? temp1 : temp2);
while (cur != null){
System.out.println(cur);
cur = cur.next;
}
}