题解 | #合并两个排序的链表#
合并两个排序的链表
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) { ListNode *newL=new ListNode(-1);// write code here struct ListNode *cur=newL; while(pHead1&&pHead2){ if(pHead1->val<=pHead2->val){ cur->next=pHead1;//important pHead1=pHead1->next; } else{ cur->next=pHead2;//crucial pHead2=pHead2->next; } cur=cur->next;//important } cur->next=pHead1?pHead1:pHead2; return newL->next; } };