Cacher is the code snippet organizer for pro developers

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




ListNode* Merge(ListNode* pListHead1, ListNode* pListHead2)
    {
            if(pListHead1 == NULL)
    {
        return pListHead2;
    }
     
    if(pListHead2 == NULL)
    {
        return pListHead1;
    }
    ListNode* pNode1 = pListHead1;
    ListNode* pNode2 = pListHead2;
     
    ListNode* pNewHead = new ListNode(0);
    ListNode* temp = pNewHead;
     
    while(pNode1 != NULL && pNode2 != NULL)
    {
        if(pNode1->val < pNode2->val)
        {
            temp->next = pNode1;
            pNode1 = pNode1->next;
            temp = temp->next;
        }
        else
        {
            temp->next = pNode2;
            pNode2 = pNode2->next;
            temp = temp->next;
 
        }
    }
    if(pNode1 != NULL)
    {
        temp->next = pNode1;
    }
    else
    {
        temp->next = pNode2;
    }
    return pNewHead->next;
}