题解 | #合并两个排序的链表# | C++
合并两个排序的链表
https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337
/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param pHead1 ListNode类 * @param pHead2 ListNode类 * @return ListNode类 */ ListNode* Merge(ListNode* pHead1, ListNode* pHead2) { // write code here if (pHead1 == nullptr) return pHead2; if (pHead2 == nullptr) return pHead1; ListNode* ans = nullptr; if (pHead1->val < pHead2->val) { ans = pHead1; ans->next = Merge(pHead1->next, pHead2); } else { ans = pHead2; ans->next = Merge(pHead1, pHead2->next); } return ans; } };