题解 | #合并两个排序的链表#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param pHead1 ListNode类 
 * @param pHead2 ListNode类 
 * @return ListNode类
 */
struct ListNode* Merge(struct ListNode* pHead1, struct ListNode* pHead2 ) {
    if(pHead1==NULL)return pHead2;
    if(pHead2==NULL)return pHead1; 
    struct ListNode* head = pHead1-> val > pHead2 -> val ? pHead2 : pHead1;
    struct ListNode* node = NULL;
    while (pHead1!= NULL && pHead2!= NULL){
        if(pHead1->val<=pHead2->val){
            while (pHead1->next!= NULL&&pHead1->next->val<=pHead2->val){
                pHead1=pHead1->next;
            }
            node =pHead1->next;
            pHead1->next= pHead2;
            pHead1 = node;
        }else {
            while(pHead2->next!=NULL&&pHead2->next->val<=pHead1->val){
                pHead2=pHead2->next;
            }
            node=pHead2->next;
            pHead2->next=pHead1;
            pHead2=node;
        }
    }
    return head;
}