合并两个排序的链表

输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。

链接：https://www.nowcoder.com/questionTerminal/d8b6b4358f774294a89de2a6ac4d9337

来源：牛客网

//递归版

public class Solution {

     public ListNode Merge(ListNode list1,ListNode list2) {

         if (list1 == null )

             return list2;

         if (list2 == null )

             return list1;

         ListNode head;

         if (list1.val < list2.val){

             head = list1;

             list1.next = Merge(list1.next,list2);

         } else {

             head = list2;

             list2.next = Merge(list1,list2.next);

         }

         return head;

     }

} //非递归版（归并的思想） public class Solution {

     public ListNode Merge(ListNode list1,ListNode list2) {

         if (list1 == null )

             return list2;

         if (list2 == null )

             return list1;

         ListNode head = new ListNode( 0 );

         ListNode temp = head;

         while (list1 != null && list2 != null ){

             if (list1.val < list2.val){

                 temp.next = list1;

                 list1 = list1.next;

             } else {

                 temp.next = list2;

                 list2 = list2.next;

             }

             temp = temp.next;

         }

         if (list1 != null )

             temp.next = list1;

         if (list2 != null )

             temp.next = list2;

         return head.next;

     }

}