【22.合并两个有序链表】

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

示例 1：

输入：l1 = [1,2,4], l2 = [1,3,4]
输出：[1,1,2,3,4,4]
示例 2：

输入：l1 = [], l2 = []
输出：[]
示例 3：

输入：l1 = [], l2 = [0]
输出：[0]
 

提示：

两个链表的节点数目范围是 [0, 50]
-100 <= Node.val <= 100
l1 和 l2 均按 非递减顺序 排列

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        ListNode list3=new ListNode(0);
        ListNode temp=list3;
        while(list1 != null && list2 != null){
            if(list1.val < list2.val){
              temp.next=list1;
             temp=temp.next;
              list1=list1.next;
            }else{
             temp.next=list2;
             temp=temp.next;
             list2=list2.next;
            }
        }
        if(list1 == null){
                temp.next=list2;
            }
        if(list2 == null){
                temp.next=list1;
            }
        return list3.next;
    }
}

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
       if(list1 == null) return list2;
       if(list2 == null) return list1;
       ListNode res=list1.val<list2.val?list1:list2;
       res.next=mergeTwoLists(res.next,list1.val<list2.val?list2:list1);
       return res;
    }