剑指 Offer 25. 合并两个排序的链表

输入两个递增排序的链表，合并这两个链表并使新链表中的节点仍然是递增排序的。

示例1：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4
限制：

0 <= 链表长度 <= 1000

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

python

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if l1 == None: 
            return l2
        if l2 == None: 
            return l1
        if l1.val <= l2.val:
            head = ListNode(l1.val)
            l1 = l1.next
        else:
            head = ListNode(l2.val)
            l2 = l2.next
        node = head
        while l1 and l2:
            if l1.val <= l2.val:
                node.next = ListNode(l1.val)
                l1 = l1.next
                node = node.next
            else:
                node.next = ListNode(l2.val)
                l2 = l2.next
                node = node.next
        if l1 == None:
            while l2:
                node.next = ListNode(l2.val)
                l2 = l2.next
                node = node.next
        else:
            while l1:
                node.next = ListNode(l1.val)
                l1 = l1.next
                node = node.next
        return head

c++

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

// 1.listnode构建是ListNode *head = new ListNode(0);