Lcode算法5：合并两个有序链表

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

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

示例 2：

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

示例 3：

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

/**
 * 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 newNode = null;
        ListNode first = null;
        if(list1.val<list2.val){
           newNode = new ListNode(list1.val);
            list1 = list1.next;
        }else{
           newNode = new ListNode(list2.val);
            list2 = list2.next;
        }
        first = newNode;
        while(list1 !=null && list2 !=null){
            if(list1.val<list2.val){
                newNode.next = new ListNode(list1.val);
                list1 = list1.next;
            }else{
                newNode.next = new ListNode(list2.val);
                list2 = list2.next;
            }
            newNode = newNode.next;
        }
        if(list1 !=null){
           newNode.next  = list1;
        }

        if(list2 !=null){
           newNode.next  = list2;
        }
        return first;
    }


    
}