合并两有序链表 Merge Two Sorted Lists

为什么80%的码农都做不了架构师？>>>   

问题：

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.

解决：

①递归方法，耗时14ms.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */

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) {
            ListNode tmp = l1;
            tmp.next = mergeTwoLists(l1.next,l2);            
        }else{
            ListNode tmp = l2;
            tmp.next = mergeTwoLists(l1,l2.next);
        }
        return tmp;
    }
}

②非递归方法，新建一个头节点，依次比较两个链表的值，按照顺序添加到头节点后面即可，耗时16ms。

public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode header = new ListNode(-1);
        ListNode cur = header;
        while(l1 != null && l2 != null){
            if (l1.val < l2.val) {
                cur.next = l1;
                l1 = l1.next;
            }else{
                cur.next = l2;
                l2 = l2.next;
            }
            cur = cur.next;
        }
        cur.next = (l1 != null) ? l1 : l2;
        return header.next;
    }
}

转载于:https://my.oschina.net/liyurong/blog/994822