两个有序单向链表的结合，输出一个新的有序单向列表

分析：

现在有两个有序的单向列表，要让他们合并为一个链表，而且保持有序
1.我们采取将list1合并到list2上的方法

1. 也就是说双层遍历，里层为list2的遍历
2. 每次遍历到list1的辅助节点temp时，跟list2的每一个节点比较
3. 如果temp.no<temp2.next.no那么就把list2的节点链到temp2节点的后面。
4. 如果循环玩temp2仍然没有找到就将temp链到list2的最后面
5. 最后将list2返回

代码：

节点类

class HeroNode {
    public int no;
    public String name;
    public String nikename;
    public HeroNode next;//指向下一个节点

    //构造器
    public HeroNode(int no, String name, String nikename) {
        this.no = no;
        this.name = name;
        this.nikename = nikename;
    }
    //为了显示方便，我们重写一下tostring方法


    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                ", nikename='" + nikename + '\'' +

                '}';
    }
}

结合方法：

public  SingleLinkedList cludee(SingleLinkedList singleLinkedList1,SingleLinkedList SingleLinkedList2){
        head=singleLinkedList1.head;
        HeroNode temp1= head.next;
        HeroNode temp2 = SingleLinkedList2.head;//temp2从list2的头结点开始
        HeroNode next=null;
        if (temp1==null){
            return SingleLinkedList2;
        }
        while (temp1!=null){
            
            while (temp2.next!=null){
              if(temp1.no<temp2.next.no){
                  //链上
                  next=temp1.next;
                  temp1.next=temp2.next;
                  temp2.next=temp1;
                 
                  break;
              }
              if (temp2.next.next==null)
              {
                  temp2.next.next=temp1;
              }
              
                  temp2=temp2.next;
              
              
            }
            temp1=next;
            
        }
            return SingleLinkedList2;
    }

测试

 public static void main(String[] args) {
        HeroNode heroNode1=new HeroNode(1,"宋江","及时雨");
        HeroNode heroNode2=new HeroNode(2,"卢俊义","玉麒麟");
        HeroNode heroNode3=new HeroNode(4,"吴用","智多星");
        HeroNode heroNode4=new HeroNode(9,"林冲","豹子头");
        HeroNode heroNode5 = new HeroNode(3, "宋", "及");
        HeroNode heroNode6 = new HeroNode(6, "卢", "玉");
        HeroNode heroNode7 = new HeroNode(7, "吴", "智");
        HeroNode heroNode8 = new HeroNode(82, "林", "豹");
        SingleLinkedList singleLinkedList = new SingleLinkedList();
        singleLinkedList.addByOrder(heroNode1);
        singleLinkedList.addByOrder(heroNode2);
        singleLinkedList.addByOrder(heroNode3);
        singleLinkedList.addByOrder(heroNode4);
        SingleLinkedList singleLinkedList1 = new SingleLinkedList();
        singleLinkedList1.addByOrder(heroNode5);
        singleLinkedList1.addByOrder(heroNode6);
        singleLinkedList1.addByOrder(heroNode7);
        singleLinkedList1.addByOrder(heroNode8);
        SingleLinkedList cludee = singleLinkedList.cludee(singleLinkedList,singleLinkedList1);
        cludee.List();

测试结果：