21. 合并两个有序链表(C语言/C++)

题目详情
将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
 
示例：
输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4


——题目难度: 简单
题目链接
 

---

 

 

• C语言迭代版

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */

//迭代
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2){
        typedef struct ListNode Node;
        Node prehead = {-1,NULL};          //返回值就是prehead.next
        Node *p = NULL;
        
        if(l1 && l2){                   //判断新链表的head在哪里,让prehead.next指向新链表的head  
            if(l1->val > l2->val){
                p = l2;
                l2 = l2->next;
            }else{
                p = l1;
                l1 = l1->next;
            }
        }else if(l1==NULL){
            return l2;
        }else if(l2==NULL){
            return l1;
        }else{
            return NULL;
        }
        prehead.next = p;

        //Node *big,*small;
        while(l1 && l2)
        {
            if(l1->val > l2->val){
                p->next = l2;
                p = l2;
                l2 = l2->next;
            }else{
                p->next = l1;
                p = l1;
                l1 = l1->next;
            }  
        }
        
        if(l2==NULL){        
            p->next = l1;
        }else if(l1==NULL){             
            p->next = l2;   
        }
        return prehead.next;
}

结果


 

• C++迭代版

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode newHead(0);
        ListNode *p = &newHead;
        while (l1 != NULL && l2 != NULL) {
        	//处理两个表非空的情况。l1、l2指向当前需比较的结点
			//p3指向结果有序单链表的表尾
			if (l1->val < l2->val) {
				p->next = l1;
				p = p->next;
				l1 = l1->next;
			} else {
				p->next = l2;
				p = p->next;
				l2 = l2->next;
			}
		}
		
		if (!l1) p->next = l2;
		if (!l2) p->next = l1;
		
		return newHead.next;
    }
};

 

• 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;

        if(l2->val >= l1->val) {
            l1->next = mergeTwoLists(l1->next,l2);
            return l1;
        }else{
            l2->next = mergeTwoLists(l1,l2->next);
            return l2;
        }
    }
    
};

结果