面试难点题解析----合并两个有序链表

方法一：递归法

具体步骤如下所示：
1）比较链表1（head1）和链表2（head2）的第一个结点数据，如果head1.data<head2.data则把结果链表头结点指向链表head1中的第一个结点。
2）对剩余的链表head1.next和链表2（head2）再调用同样的方法，比较得到结果链表的第二个结点，添加到合并后列表的后面。3）一直递归调用步骤2），直到两个链表的结点都被加到结果链表中。

public class Test {
	//递归函数
    public static Node mergeList(Node head1,Node head2){
        if (head1 == null){
            return head2;
        }
        if (head2 == null){
            return head1;
        }

        Node head = null;//头节点
        if (head1.date<head2.date){
            head = head1;
            head.next = mergeList(head1.next,head2);
        }else {
            head=head2;
            head.next = mergeList(head1, head2.next);
        }
        return head;
    }


    public static void main(String[] args) {
        Node node1 = new Node(1);
        Node node3 = new Node(3);
        node1.next=node3;
        Node node5 = new Node(5);
        node3.next=node5;
        node5.next=null;

        Node node2 = new Node(2);
        Node node4 = new Node(4);
        Node node6 = new Node(6);
        node2.next=node4;
        node4.next=node6;
        node6.next=null;

        Node mergeList = mergeList(node1, node2);
        while (mergeList!=null){
            System.out.println("mergeList.date + "+mergeList.date);
            mergeList = mergeList.next;
        }
    }
}

//节点
class Node{
    Node next = null;
    int date;
    public Node(int date){
        this.date = date;
    }
}

方法二：非递归法

在遍历两个链表的过程中，改变当前链表指针的指向来把两个链表串联成一个有序的列表

package com.xbc.util;

public class Test {
    public static Node mergeList(Node head1, Node head2) {
        if (head1 == null) {
            return head2;
        }
        if (head2 == null) {
            return head1;
        }

        Node p1, p2, head;

        //确定合并后的头节点
        if (head1.date<head2.date){
            head=head1;
            p1 = head1.next;
            p2 = head2;
        }else{
            head = head2;
            p1 = head1;
            p2=head2.next;
        }

        Node pcur = head;
        while (p1!=null&&p2!=null){
            //把head1当前遍历的结点添加到合并后链表的尾部
            if (p1.date<= p2.date){
                pcur.next=p1;
                pcur=p1;
                p1=p1.next;
            }else {//把head2当前遍历的结点添加到合并后链表的尾部
                pcur.next=p2;
                pcur = p2;
                p2=p2.next;
            }
            //head2链表已经遍历结束，把head1遍历剩余的结点添加到合并后链表的尾部
            if (p1!=null){
                pcur.next=p1;
            }
            if (p2!=null){
                pcur.next=p2;
            }
        }
        return head;
    }


    public static void main(String[] args) {
        Node node1 = new Node(1);
        Node node3 = new Node(3);
        node1.next = node3;
        Node node5 = new Node(5);
        node3.next = node5;
        node5.next = null;

        Node node2 = new Node(2);
        Node node4 = new Node(4);
        Node node6 = new Node(6);
        node2.next = node4;
        node4.next = node6;
        node6.next = null;

        Node mergeList = mergeList(node1, node2);
        while (mergeList != null) {
            System.out.println("mergeList.date + " + mergeList.date);
            mergeList = mergeList.next;
        }


    }
}

//节点
class Node {
    Node next = null;
    int date;

    public Node(int date) {
        this.date = date;
    }
}