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

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

/**
 * 
 * @param pHead1 ListNode类 
 * @param pHead2 ListNode类 
 * @return ListNode类
 */
struct ListNode* Merge(struct ListNode* pHead1, struct ListNode* pHead2 ) {
    // write code here
    struct ListNode*vhead=(struct ListNode*)malloc(sizeof(struct ListNode));
    vhead->val=-1;
    struct ListNode*p=vhead;
    while(pHead1&&pHead2)
    {
        if (pHead1->val<=pHead2->val)
        {
            p->next=pHead1;
            pHead1=pHead1->next;
        }
        else {
        p->next=pHead2;
        pHead2=pHead2->next;
        }
       p=p->next;
       
    }
 p->next=pHead1?pHead1:pHead2;
        return vhead->next;
}