leetcode 21.合并两个有序链表

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

解题思路：迭代和递归

解法一：递归

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;
        }
    }
}

解法二：迭代

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
    ListNode newHead = new ListNode();
    ListNode tmp = newHead;
    while (l1 != null && l2 != null) {
        if (l1.val <= l2.val) {
            tmp.next = new ListNode(l1.val, null);
            l1 = l1.next;
        }else {
            tmp.next = new ListNode(l2.val, null);
            l2 = l2.next;
        }
        tmp = tmp.next;
    }
    tmp.next = l1 == null ? l2 : l1;
    return newHead.next;
}