[leetcode][java]Merge Two Sorted Lists 合并两个排序的链表

递归解法：

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

非递归解法：

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
            if (l1 == null) {
                return l2;
            }
            if (l2 == null) {
                return l1;
            }
            ListNode head = null, cur = null;
            while (l1 != null && l2 != null) {
                if (l1.val <= l2.val) {
                    if (head == null) {
                        head = l1;
                        cur = l1;
                    } else {
                        cur.next = l1;
                        cur = l1;
                    }
                    l1 = l1.next;
                } else {
                    if (head == null) {
                        head = l2;
                        cur = l2;
                    } else {
                        cur.next = l2;
                        cur = l2;
                    }
                    l2 = l2.next;
                }
            }
            if (l1 != null) {
                cur.next = l1;
            }
            if (l2 != null) {
                cur.next = l2;
            }
            return head;
        }