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

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

解法一：递归

/**
 * 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 == NULL)
            return l2;
        else if(l2 == NULL)
            return l1;
        
        ListNode* head = NULL;
        if(l1->val <= l2->val){
            l1->next = mergeTwoLists(l1->next,l2);
            return l1;
        }else{
            l2->next = mergeTwoLists(l1,l2->next);
            return l2;
        }
    }
};

解法二：非递归

/*
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 == nullptr && pHead2 == nullptr)
            return nullptr;
        else if(pHead1 != nullptr && pHead2 == nullptr)
            return pHead1;
        else if(pHead1 == nullptr && pHead2 != nullptr)
            return pHead2;
        
        ListNode *head,*temp;
        if(pHead1->val <= pHead2->val){//取较小值作头结点
            head = pHead1;
            pHead1 = pHead1->next;
        } 
        else{
            head = pHead2;
            pHead2 = pHead2->next;
        } 
        temp = head;
        
        while(pHead1 != nullptr && pHead2 != nullptr){
            if(pHead1->val <= pHead2->val){
                temp->next = pHead1;
                temp = pHead1;
                pHead1 = pHead1->next;
            } 
            else{
                temp->next = pHead2;
                temp = pHead2;
                pHead2 = pHead2->next;
            } 
        }
        //一个链表为空，将另一个不为空的链表直接接上即可
        if(pHead1 != nullptr)
            temp->next = pHead1;
        else
            temp->next = pHead2;
        
        return head;
    }
};