合并两个排序的链表（Java实现）

public class E25MergeOrderedList {
    //合并两个排序的链表

    private class ListNode{
        int value;
        ListNode nextNode;
    }

    public static ListNode mergeOrderedList(ListNode head1, ListNode head2){
        //输入验证&递归终止条件，包含都等于null的情况
        if (head1 == null)
            return head2;
        if (head2 == null)
            return head1;
        //递归
        ListNode mergedHead = null;
        if (head1.value < head2.value){
            mergedHead = head1;
            mergedHead.nextNode = mergeOrderedList(head1.nextNode, head2);
        }
        else{
            mergedHead = head2;
            mergedHead.nextNode = mergeOrderedList(head1, head2.nextNode);
        }
        return mergedHead;
    }

    //测试用例
    public static void main(String[] args){
        /*输入都为null
        * 输入只有一个为null*/
    }
}