首先写一个节点类,代码如下
public class Node {
public int data;
public Node next;
public Node(int data)
{
this.data = data;
}
}
然后再写一个创建两个有序的链表的类(添加节点时已按大小顺序添加)
public class BuildList {
public Node head = null;
public void addNode(int k)
{
Node newNode = new Node(k);
if(head==null)
{
head = newNode;
return;
}
Node lastNode = head;
while(lastNode.next!=null)
{
lastNode = lastNode.next;
}
lastNode.next = newNode;
}
public void printList()
{
Node printNode = head;
while(printNode != null)
{
System.out.println(printNode.data);
printNode = printNode.next;
}
}
}
再写一个实现合并的类,代码如下
public class MergeSortedList {
public Node merge;
public void merge(Node node_1,Node node_2)
{
Node p1 = node_1;
Node p2 = node_2;
if(p1.data>p2.data)
{
merge = p2;
p2 = p2.next;
}
else
{
merge = p1;
p1 = p1.next;
}
Node p= merge;
while(p1!=null&&p2!=null)
{
if(p1.data>=p2.data)
{
p.next = p2;
p2 = p2.next;
p = p.next;
}
else
{
p.next = p1;
p1 = p1.next;
p = p.next;
}
}
if(p1!=null)
{
p.next = p1;
}
if(p2!=null)
{
p.next = p2;
}
}
public void printList()
{
Node printNode = merge;
while(printNode != null)
{
System.out.println(printNode.data);
printNode = printNode.next;
}
}
}
最后写一个测试类,代码如下
public class Test {
public static void main(String[] args) {
// TODO Auto-generated method stub
BuildList bl1 = new BuildList();
BuildList bl2 = new BuildList();
for(int i = 0;i<10;i++)
{
if(i%2==0)
{
bl1.addNode(i);
}
else
{
continue;
}
}
for(int i = 0;i<10;i++)
{
if(i%2!=0)
{
bl2.addNode(i);
}
else
{
continue;
}
}
MergeSortedList msl = new MergeSortedList();
msl.merge(bl1.head,bl2.head);
msl.printList();
}
}