[leetcode note] Merge Two Sorted Lists

时间: 2019-12-02
题目地址: https://leetcode.com/problems/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.

合并两个有序链表，并将其作为新链表返回。 应该通过将前两个列表的节点拼接在一起来创建新列表。

Example :

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

Solution:

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

Runtime: 0 ms, faster than 100.00% of Java online submissions for Merge Two Sorted Lists.
Memory Usage: 40.7 MB, less than 11.78% of Java online submissions for Merge Two Sorted Lists.

欢迎关注公众号(代码如诗):