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

/**
 * 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 node;
    struct ListNode *pHead = &node;
    struct ListNode *cur = pHead;
    while (1) {
        if (pHead1 == 0) { cur->next = pHead2; break; }
        if (pHead2 == 0) { cur->next = pHead1; break; }
        if (pHead1->val < pHead2->val){
            cur->next = pHead1;
            cur = cur->next;
            pHead1 = pHead1->next;
        }
        else {
            cur->next = pHead2;
            cur = cur->next;
            pHead2 = pHead2->next;
        }
    }
    return pHead->next;
}