21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

数组转化（耗时而且不符合题意）

先将两个排序链添加到数组，数组排序后再转化为链表，相当耗时，也比较占空间，题目要求新链表不另外创建。代码如下：

public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        List<Integer> list = new ArrayList<Integer> ();
        while(l1 != null) {
            list.add(l1.val);
            l1 = l1.next;
        }
        while(l2 != null) {
            list.add(l2.val);
            l2 = l2.next;
        }
        if(list.size() == 0) return null;
        int [] arr = new int[list.size()];
        for(int i = 0; i < list.size(); i++) {
            arr[i] = list.get(i);
        }
        Arrays.sort(arr);
        ListNode temp = new ListNode(arr[0]);
        ListNode head = temp;
        for(int i = 1; i < arr.length; i++) {
            temp.next = new ListNode(arr[i]);
            temp = temp.next;
        }

        return head;
    }
}

---

递归求解

递归求解，相对简单易懂，代码如下：

public class Solution {
    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;
        }
    }
}