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

示例:

输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4

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

标签: leetcode, java

添加新评论