话不多说，直接上代码

package linkedLIst;class hero
{private int no;private String name;private String nickName;hero next;public hero(int no,String name,String nickName){this.no=no;this.name=name;this.nickName=nickName;}public int getNo() {return no;}public void setNo(int no) {this.no = no;}public String getName() {return name;}public void setName(String name) {this.name = name;}public String getNickName() {return nickName;}public void setNickName(String nickName) {this.nickName = nickName;}@Overridepublic String toString() {return "hero [no=" + no + ", name=" + name + ", nickName=" + nickName + "]";  }
}class myLinkedList
{private hero head=new hero(0,"","");public hero getHead() {return head;}public void setHead(hero head) {this.head = head;}public void add(hero he){hero temp=head;boolean flag=true;while(flag){if(temp.next==null)break;if(temp.next.getNo()>he.getNo()){break;}if(temp.next.getNo()==he.getNo())  {flag=false;break;}temp=temp.next;}if(flag==false){System.out.printf("编号[%d]已经存在，不能添加~~\n",he.getNo());return;}he.next=temp.next;temp.next=he;}public void update(hero newHero){if(head.next==null){System.out.println("链表为空~~");return;}hero temp=head.next;boolean flag=true;while(flag){if(temp==null)break;  //表示链表已经遍历完if(temp.getNo()==newHero.getNo()){flag=false;break;}temp=temp.next;}if(flag==false){temp.setName(newHero.getName());temp.setNickName(newHero.getNickName());}else{System.out.printf("没有找到编号为【%d】的英雄\n",newHero.getNo());return;}}public void delete(hero dhero){if(head.next==null){System.out.println("链表为空~~");return ;}boolean flag=true;hero temp=head;while(flag){if(temp.next==null)break;if(temp.next.getNo()==dhero.getNo()){flag=false;break;}temp=temp.next;}if(flag==false){temp.next=temp.next.next;System.out.println("删除成功~~");}else{System.out.println("没有找到该节点~~");}}/*** * 获取链表的长度* */public int getLength()  {if(head.next==null){return 0;}hero h=head.next;int length=0;while(h!=null){length++;h=h.next;}return length;}/*** * 获取倒数第index个节点* * */public hero getIndex(int size,int index){if(head.next==null){return null;}if(index<=0||index>size)return null;hero h=head.next;for(int i=0;i<size-index;i++)h=h.next;return h;}/*** 链表反转* */public void reserve(){if(head.next==null||head.next.next==null)  //链表为空或者只有一个节点，则不需要反转{return;}hero curr=head.next;hero next=curr;hero reserveHead=new hero(0,"","");while(curr!=null){next=curr.next;curr.next=reserveHead.next;reserveHead.next=curr;//System.out.println(curr.toString());curr=next;}head.next=reserveHead.next;}public void show()   {if(head.next==null){System.out.println("链表为空");  return;  }hero temp=head.next;  while(temp!=null){System.out.println(temp.toString());temp=temp.next;}}
}class sort
{private myLinkedList L1;private myLinkedList L2;private hero head;public sort(myLinkedList L1,myLinkedList L2){this.L1=L1;this.L2=L2;	}public void sortLinkedList(){if(L1.getHead().next==null&&L2.getHead().next==null)   //如果两条链表都是空链表，则不需要排序了return;hero curr1=L1.getHead().next;hero next1=curr1.next;hero curr2=L2.getHead().next;hero next2=curr2.next;if(L1.getHead().next.getNo()<=L2.getHead().next.getNo()){head=L1.getHead().next;  curr1=L1.getHead().next.next;next1=curr1.next;}else{head=L2.getHead().next;  curr2=L2.getHead().next.next;  next1=curr2.next;}hero temp=head;   //System.out.println("temp"+temp.toString());  while(curr1!=null&&curr2!=null){if(curr1.getNo()<=curr2.getNo()){next1=curr1.next;curr1.next=temp.next;temp.next=curr1;temp=temp.next;curr1=next1;//	System.out.println("curr1  temp"+temp.toString());}else{next2=curr2.next;curr2.next=temp.next;temp.next=curr2;temp=temp.next;curr2=next2; //System.out.println("curr2 temp"+temp.toString());}}//	temp.next=null;//temp=temp.next;if(curr1!=null)temp.next=curr1;elsetemp.next=curr2;while(temp!=null){//System.out.println("链接后的"+temp.toString());temp=temp.next;}/*hero temp1=head;		while(temp1!=null){System.out.println(temp1.toString());temp1=temp1.next;}*/}public void show(){hero temp=head;while(temp.next!=null){System.out.println(temp.toString());temp=temp.next;}}
}public class LinkedList {public static void main(String[] args){hero h1=new hero(1,"宋江","及时雨");hero h2=new hero(4,"吴用","智多星");hero h3=new hero(7,"林冲","豹子头");myLinkedList mls1=new myLinkedList();mls1.add(h1);mls1.add(h3);mls1.add(h2);mls1.show();hero he1=new hero(2,"宋江","及时雨");hero he2=new hero(3,"吴用","智多星");hero he3=new hero(8,"林冲","豹子头");hero he4=new hero(9,"宋江","及时雨");hero he5=new hero(11,"吴用","智多星");hero he6=new hero(10,"林冲","豹子头");myLinkedList mls2=new myLinkedList();mls2.add(he1);mls2.add(he3);mls2.add(he2);mls2.add(he4);mls2.add(he5);mls2.add(he6);mls2.show();System.out.println("\n将两个已经排序的链表按照排序的方式变成的链表的结果：");sort s=new sort(mls1,mls2);s.sortLinkedList();s.show();}
}