将两个单链表合并形成的单链表仍然有序

package com.atguigu.linkedlist;

/**
 * @author carry_C
 * @date 2020/5/30 - 14:13
 * 要求：合并两个有序的单链表，合并之后的链表依然有序
 */
public class SingleLinkedListDemoTest1 {
   
    public static void main(String[] args) {
   
        //创建第一个单链表
        SingleLinkedList2 singleLinkedList01 = new SingleLinkedList2();

        //创建第二个单链表
        SingleLinkedList2 singleLinkedList02 = new SingleLinkedList2();

        //创建节点
        HeroNode2 hero1 = new HeroNode2(1,"宋江1","及时雨1");
        HeroNode2 hero2 = new HeroNode2(2,"卢俊义2","玉麒麟2");
        HeroNode2 hero3 = new HeroNode2(3,"吴用3","智多星3");
        HeroNode2 hero4 = new HeroNode2(4,"林冲4","豹子头4");

        HeroNode2 hero5 = new HeroNode2(5,"宋江5","及时雨5");
        HeroNode2 hero6 = new HeroNode2(6,"卢俊义6","玉麒麟6");
        HeroNode2 hero7 = new HeroNode2(7,"吴用7","智多星7");
        HeroNode2 hero8 = new HeroNode2(8,"林冲8","豹子头8")