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

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
#include <cstddef>
#include <iostream>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pHead1 ListNode类 
     * @param pHead2 ListNode类 
     * @return ListNode类
     */
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2) 
    {
        ListNode* cur1=pHead1;
        ListNode* cur2=pHead2;
        ListNode* res =new ListNode(-1);
        ListNode* temp1=res;
        while(cur1!=NULL&&cur2!=NULL)
        {
            if(cur1->val>=cur2->val)
            {
                res->next=cur2;
                cur2=cur2->next;
                res=res->next;
            }
            else {
                res->next=cur1;
                cur1=cur1->next;
                res=res->next;
            }
        }
        if(cur1==NULL)
        {
            res->next=cur2;
        }
        if(cur2==NULL)
        {
            res->next=cur1;
        }
        return temp1->next;

    }
};