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

/**
 * 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 && pHead2 == NULL)
    return NULL;
    struct ListNode *H1 = pHead1;
    struct ListNode *H2 = pHead2;
    struct ListNode *H = (struct ListNode *)malloc(sizeof(struct ListNode));
    struct ListNode *H3 = NULL;
    H3 = H;
    while(H1 && H2)
    {
        if(H1->val <= H2->val)
        {
            H3->next = H1;
            H1 = H1->next;
        }
        else
        {
            H3->next = H2;
            H2 = H2->next;
        }   
        H3 = H3->next; 
    }
    if(H1 == NULL)
    H3->next = H2;
    else
    H3->next = H1;
    return H->next;
}