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

/**
 * 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 *p0 = NULL;
    if (!pHead1) return pHead2;
    if (!pHead2) return pHead1;
    if (pHead1->val > pHead2->val)
      {
        p0 = pHead2;
        p0->next =Merge(pHead1,pHead2->next);
      }
    else
      {
         p0 = pHead1;
         p0->next = Merge(pHead1->next, pHead2);
      }
    return p0;
   
}

递归思想