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

/**
 * 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* list1 = pHead1;
    struct ListNode* list2 = pHead2;
    struct ListNode* tmpHead = malloc(sizeof(struct ListNode));
    struct ListNode* tmp = tmpHead;

    while (list1 != NULL && list2 != NULL) {
        if (list1 -> val < list2 -> val) {
            tmp -> next = list1;
            list1 = list1 -> next;
        } else {
            tmp -> next = list2;
            list2 = list2 -> next;
        }

        tmp = tmp -> next;

    }

    while (list1 != NULL) {
        tmp -> next = list1;
        list1 = list1 -> next;
        tmp = tmp -> next;
    }

    while (list2 != NULL) {
        tmp -> next = list2;
        list2 = list2 -> next;
        tmp = tmp -> next;
    }

    tmpHead = tmpHead -> next;
    return tmpHead;

}