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

/**
 * 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* dummy = (struct ListNode*)malloc(sizeof(struct ListNode));
    dummy->val = 0;

    struct ListNode* next = dummy;
    struct ListNode* pCur1 = pHead1;
    struct ListNode* pCur2 = pHead2;
    while (pCur1 != NULL && pCur2 != NULL) {
        if (pCur1->val < pCur2->val) {
            next->next = pCur1;
            pCur1 = pCur1->next;
        } else {
            next->next = pCur2;
            pCur2 = pCur2->next;
        }
        next = next->next;
    }

    if (pCur1 != NULL)
        next->next = pCur1;
    if (pCur2 != NULL)
        next->next = pCur2;
    return dummy->next;
}