链表：合并有序链表

    两个有序链表l1 和l2，把它们合并成一个有序链表

    一、一般方式

 public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null)
            return l2;
        if(l2 == null)
            return l1;
        ListNode result = new ListNode(0);
        ListNode resultc = result;
        while(l1 != null || l2 != null){
            if(l1 != null && (l2 == null || l1.val <= l2.val)){
                resultc.next = l1;
                resultc = resultc.next;
                l1 = l1.next;
            }
             else if(l2 != null && (l1 == null || l2.val < l1.val)){
                resultc.next = l2;
                resultc = resultc.next;
                l2 = l2.next;
            }
        }
        return result.next;
    }

    二、递归方式

 public ListNode mergeTwoLists(ListNode l1, ListNode l2) { 
    if(l1 == null) return l2;
    if(l2 == null) return l1;

    if(l1.val < l2.val) {
        l1.next = mergeTwoLists(l1.next, l2);
        return l1;
    } else {
        l2.next = mergeTwoLists(l2.next, l1);
        return l2;
    }
}