LeetCode 21.合并两个有序链表

目录

 

0.题目描述

1.解题分析 

2.优质范例

---

0.题目描述

1.解题分析 

看完题后第一个思路是：新起一个节点作为合并链表的头节点，然后同时遍历两个有序链表，比较它们当前节点的大小，以较小的节点的值，new一个新的节点并接入合并链表。合并链表指针后移一位，有序链表中有较小当前节点的链表指针后移一位。重复上诉操作直到两个有序链表遍历结束或者其中一个有序链表遍历结束，那么把未遍历结束的有序链表直接接到合并链表末尾即可。

初版代码如下：

 ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode *head, *merge;
        head = new ListNode(-999);
        merge = head;

         if (l1 == NULL || l2 == NULL) {
            return l1 == NULL? l2 : l1;
        }
        while (!(l1 == NULL && l2 == NULL)) {
            if (l1->val < l2->val) {
                if (head->val == -999) {
                    head->val = l1->val;
                }
                else {
                    ListNode *newnode = new ListNode(l1->val);
                    head->next = newnode;
                    head = head->next;
                }
                l1 = l1->next;
            }
            else {
                if (head->val == -999) {
                    head->val = l2->val;
                }
                else {
                    ListNode *newnode = new ListNode(l2->val);
                    head->next = newnode;
                    head = head->next;
                }
                l2 = l2->next;
            }
            if (l1 == NULL) {
                head->next = l2;
                break;
            }
            if (l2 == NULL) {
                head->next = l1;
                break;
            }
        }
        return merge;
    }

简化逻辑后：

 ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode *head = new ListNode(-999), *merge;
        merge = head;

        if (l1 == NULL || l2 == NULL) {
            return l1 == NULL? l2 : l1;
        }
        while (l1&&l2) {
            if (l1->val < l2->val) {
                head->next = l1;
                l1 = l1->next;
            }
            else {
                head->next = l2;
                l2 = l2->next;
            }
            head = head->next;
        }
        head->next = l1 == NULL? l2 : l1;
        return merge->next;
    }

复杂度分析：

• 时间复杂度：O(n)
• 空间复杂度：O(n)

第二个思路是：将两个有序链表依次当作输入源，写一个链表的插入函数，重新创建一个新的链表。时间关系就不写代码实现了。

 

2.优质范例

    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode *Node = new ListNode(0) ,*Node_first;
        Node_first = Node;
        ListNode *Nodea = l1;
        ListNode *Nodeb = l2;
        if(l1 ==NULL)
            return l2;
        if(l2 ==NULL)
            return l1;
        while((Nodea!=NULL)&(Nodeb!=NULL))
        {
            if(Nodea->val==Nodeb->val)
            {
                Node->next = new ListNode(Nodea->val);
                Node = Node->next;
                Node->next = new ListNode(Nodea->val);
                Node = Node->next;
                Nodea = Nodea->next;
                Nodeb = Nodeb->next;
            }
            else if(Nodea->val<Nodeb->val)
            {
                Node->next = new ListNode(Nodea->val);
                Node = Node->next;
                Nodea = Nodea->next;                
            }
            else
            {
                Node->next = new ListNode(Nodeb->val);
                Node = Node->next;
                Nodeb = Nodeb->next;   
            }
        }
        Nodea==NULL?Node->next = Nodeb:Node->next = Nodea;
        return Node_first->next;
        
    }