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

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
        ListNode* dummy = new ListNode(0);
        ListNode* cur = dummy;
        ListNode* ptr1 = pHead1;
        ListNode* ptr2 = pHead2;
        
        while(ptr1 && ptr2){
            if(ptr1->val <= ptr2->val){
                cur->next = ptr1;
                ptr1 = ptr1->next;
            }
            else{
                cur->next = ptr2;
                ptr2 = ptr2->next;
            }
            cur = cur->next;
        }
        while(ptr1){
            cur->next = ptr1;
            ptr1 = ptr1->next;
            cur = cur->next;
        }
        while(ptr2){
            cur->next = ptr2;
            ptr2 = ptr2->next;
            cur = cur->next;
        }
        
        return dummy->next;
        
    }
};