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

示例：

输入：1->2->4, 1->3->4

输出：1->1->2->3->4->4

---

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null) return l2;
        if(l2 == null) return l1;
        ListNode res = new ListNode(0);
        ListNode now = res;
        while (l1 != null && l2 != null) {
            if (l1.val <= l2.val) {
                now.next = l1;
                now = now.next;
                l1 = l1.next;
            } else {
                now.next = l2;
                now = now.next;
                l2 = l2.next;
            }
        }
        while(l1 != null) {
            now.next = l1;
            now = now.next;
            l1 = l1.next;
        }
        while(l2 != null) {
            now.next = l2;
            now = now.next;
            l2 = l2.next;
        }
        return res.next;
    }
}

LeetCode 原题传送门

Q.E.D.