合并两个有序链表

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

//非递归
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode dummy=new ListNode(0);
        ListNode cur=dummy;
        while(l1!=null&&l2!=null){
                if(l1.val<=l2.val){
                    cur.next=l1;
                    l1=l1.next;
                    cur=cur.next;
                }else{
                    cur.next=l2;
                    l2=l2.next;
                    cur=cur.next;
                }
        }
        if(l1==null){
            cur.next=l2;
        }else{
            cur.next=l1;
        }
         return dummy.next;
    }
}
//递归
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if (l1 == null) {
            return l2;
        }
        else if (l2 == null) {
            return l1;
        }
        else if (l1.val < l2.val) {
            l1.next = mergeTwoLists(l1.next, l2);
            return l1;
        }
        else {
            l2.next = mergeTwoLists(l1, l2.next);
            return l2;
        }

    }
}