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

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
#include <cstddef>
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
        ListNode * ReturnNode=new ListNode(0);
		ListNode * head;
		ReturnNode->next=head;
		while (pHead1&&pHead2!=NULL) {
			if (pHead1->val<pHead2->val) {
			 head->next=pHead1;
			pHead1=pHead1->next;
			head=head->next;
			}
			else {
			head->next=pHead2;
			head=head->next;
			pHead2=pHead2->next;
			}
		}
		while (pHead1) {
		head->next=pHead1;
			pHead1=pHead1->next;
			head=head->next;
		}
		while (pHead2) {
		head->next=pHead2;
			pHead2=pHead2->next;
			head=head->next;
		}
	return ReturnNode->next;
    }
};