归并 ListNode* Merge(ListNode* pHead1, ListNode* pHead2) { ListNode *pNewHead = nullptr; ListNode *pCurrent = nullptr; while (pHead1 && pHead2) { if (pHead1->val > pHead2->val) { if (pNewHead) { pCurrent->next = pHead1; pHead1 = pHead1->next; pCurrent ...