剑指offer:合并两个排序的链表

最新推荐文章于 2022-04-09 20:59:46 发布

faithenXX

最新推荐文章于 2022-04-09 20:59:46 发布

阅读量199

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/zyf19930610/article/details/62426281

版权

剑指offer 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

题目描述

输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。

(这题也可以用递归来做)

/*
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)
            return pHead2;
        else if(pHead2 == NULL)
            return pHead1;
            
        ListNode* pHead;
        if(pHead1->val <= pHead2->val)
         {
              pHead = pHead1;
              pHead1 = pHead1->next;
         }
        else
        {
              pHead = pHead2;
              pHead2 = pHead2->next;
        }
        ListNode* pout =  pHead;
            
        while(pHead1 != NULL && pHead2 != NULL)
         {
             while(pHead1 != NULL && (pHead1->val <= pHead2->val))
              {
                    pHead->next = pHead1;
                    pHead1 = pHead1->next;
                    pHead =   pHead -> next;
              }
               while(pHead2 != NULL && pHead1 != NULL && (pHead1->val > pHead2->val))
              {
                    pHead->next = pHead2;
                    pHead2 = pHead2->next;
                    pHead =   pHead -> next;
              }
        }
        
        if(pHead1 == NULL)
         {
                while(pHead2 != NULL)
                {
                    pHead->next = pHead2;
                    pHead2 = pHead2->next;
                    pHead =   pHead -> next;
                }
         }
        
         if(pHead2 == NULL)
         {
                while(pHead1 != NULL)
                {
                    pHead->next = pHead1;
                    pHead1 = pHead1->next;
                    pHead =   pHead -> next;
                }
         }
        pHead -> next = NULL;
        return pout;   
    }
};