(1)new一个新的链表,定义结点用来遍历两个待排序的链表;
(2)两个待排序的链表,哪个头结点小,哪个作为新链表的头结点;
(3)对两个链表的结点进行比较,让新链表的next指向较小的结点,更新新链表的尾巴,继续比较直至某个链表遍历结束。
(4)遍历结束,如果哪个链表没遍历完,将剩下的几点串在新链表的后面,即当前尾巴的next指向为遍历完的链表。
public class mergeLink {
public static <T extends Comparable<T>>SingleLink mergeSingleLink(SingleLink<T> link1,SingleLink<T> link2) {
if (link1.size() == 0) {
return link2;
} else if (link2.size() == 0) {
return link1;
} else if (link1.size() == 0 && link2.size() == 0) {
return null;
}
SingleLink<T> newSingleLink = new SingleLink<>();
SingleLink.Entry<T> L1 = link1.getHeadEntry();
SingleLink.Entry<T> L2 = link2.getHeadEntry();
if(L1.getValue().compareTo(L2.getValue()) < 0){
newSingleLink.addTail(L1.getValue());
L1 = L1.getNext();
}else{
newSingleLink.addTail(L2.getValue());
L2= L2.getNext();
}
while(L1 != null && L2 != null){
if(L1.getValue().compareTo(L2.getValue()) < 0){
newSingleLink.getTailEntry().setNext(L1);
newSingleLink.setTailEntry(L1);
L1 = L1.getNext();
}else{
newSingleLink.getTailEntry().setNext(L2);
newSingleLink.setTailEntry(L2);
L2 = L2.getNext();
}
}
if(L1 == null){
newSingleLink.getTailEntry().setNext(L2);
}
if(L2 == null){
newSingleLink.getTailEntry().setNext(L1);
}
return newSingleLink;
}
public static void main(String[] args) {
SingleLink<Integer> singleLink1 = new SingleLink<Integer>();
SingleLink<Integer> singleLink2 = new SingleLink<Integer>();
singleLink1.addTail(1);
singleLink2.addTail(2);
singleLink2.addTail(3);//3 2 1
singleLink1.addTail(4);
singleLink2.addTail(5);
singleLink1.addTail(6);
singleLink1.addTail(8);
SingleLink<Integer> newS = new SingleLink<>();
newS = mergeSingleLink(singleLink1,singleLink2);
newS.show();
}
}