合并两个有序单链表（Java完整版）

最新推荐文章于 2022-05-04 20:19:26 发布

原创

最新推荐文章于 2022-05-04 20:19:26 发布 · 2.8k 阅读

收录于

当前文章被以下社区和专栏收录：

本文介绍了如何使用Java编程语言合并两个已排序的单链表，以创建一个新的有序链表。通过具体的操作步骤和代码示例，展示了合并过程。

public class LinkedList {
	private int data;
	private LinkedList next;
	public LinkedList(int data){
		this.data = data;
		this.next = null;
	}
	public int getData(){
		return data;
	}
	public void setData(int data){
        this.data = data;
}
	public LinkedList getNext(){
		return next;
	}
	public void setNext(LinkedList next){
		this.next = next;
	}
	public static LinkedList mergeList(LinkedList a,LinkedList b){
		LinkedList result = null;
		if(a == null) return b;
		if(b == null) return a;
		if(a.getData() <= b.getData()){
			result = a;
			result.setNext(mergeList(a.getNext(),b));
		}else{
			result = b;
			result.setNext(mergeList(a,b.getNext()));
		}
		return result;
	}
    public static void main(String[] args){
    	LinkedList node1 = new LinkedList(1);
    	LinkedList node2 = new LinkedList(2);
    	LinkedList node3 = new LinkedList(3);
    	LinkedList node4 = new LinkedList(4);
    	LinkedList node5 = new LinkedList(5);
		node1.setNext(node2);
		nod

标签