合并两个排序的链表

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
        if(pHead1 == NULL || pHead2 == NULL)
           return pHead1 != NULL ? pHead1 : pHead2;
        ListNode* tmp = new ListNode(0);
        ListNode* newp =tmp;
        while(pHead1 && pHead2){
            if(pHead1->val < pHead2->val){
                tmp->next = pHead1;
                pHead1 = pHead1->next;
            }
            else{
                tmp->next = pHead2;
                pHead2 = pHead2->next;
            }
            tmp = tmp->next;
            if(pHead1)
                tmp->next = pHead1;
            if(pHead2)
                tmp->next = pHead2;
        }
        newp = newp->next;
        return newp;
    }
};
/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
        if(pHead1 == NULL || pHead2 == NULL)
           return pHead1 != NULL ? pHead1 : pHead2;
        if(pHead1->val < pHead2->val){
            pHead1->next = Merge(pHead1->next, pHead2);
            return pHead1;
        }
        else{
            pHead2->next = Merge(pHead1, pHead2->next);
            return pHead2;
        }
    }
};
/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
        if(pHead1 == NULL || pHead2 == NULL)
           return pHead1 != NULL ? pHead1 : pHead2;
        ListNode* res = NULL;
        if(pHead1->val < pHead2->val){
            res = pHead1;
            res->next = Merge(pHead1->next, pHead2) ;
        }
        else{
            res = pHead2;
            res->next = Merge(pHead1, pHead2->next);
        }
        return res;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值