合并两个排序的链表

题目描述

输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。

题目链接：https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&&tqId=11169&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

代码：

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        ListNode* head=new ListNode(-1);
        ListNode* res=head;
        while(pHead1&&pHead2)
        {
            int x1=pHead1->val,x2=pHead2->val;
            if(x1<=x2)
            {
                res->next=pHead1;
                pHead1=pHead1->next;
            }
            else
            {
                res->next=pHead2;
                pHead2=pHead2->next;
            }
            res=res->next;
        }
        while(pHead1)
        {
            res->next=pHead1;
            res=res->next;
            pHead1=pHead1->next;
        }
        while(pHead2)
        {
            res->next=pHead2;
            res=res->next;
            pHead2=pHead2->next;
        }
        return head->next;
    }
};