《数据结构》严蔚敏版（java解）——第二章 线性表04 顺序单链表合并

代码实现：

package csdn.wj.linear;

import csdn.wj.assistant.Node;

public class Linear04 {
	
	public Node combineLinkList(Node leftFirst,Node rightFirst){
		Node midiumFirst = new Node(-99);
		while(leftFirst.next!=null&&rightFirst.next!=null){
			if(leftFirst.data >= rightFirst.data){
				if(midiumFirst.next==null){
					midiumFirst = rightFirst;
				}else{
					midiumFirst.next = rightFirst;
				}
				midiumFirst = midiumFirst.next;
				
				
				if(rightFirst.next!=null){
					rightFirst = rightFirst.next;
				}else{
					midiumFirst.next = leftFirst;
					break;
				}
			}else{
				if(midiumFirst.next==null){
					midiumFirst = leftFirst;
				}else{
					midiumFirst.next = leftFirst;
				}
				midiumFirst = midiumFirst.next;
				
				
				if(leftFirst.next!=null){
					leftFirst = leftFirst.next;
				}else{
					midiumFirst.next = rightFirst;
					break;
				}
			}
		}
		return midiumFirst;
		
	}
	
	public static void main(String args[]){
		
	}
}