《剑指offer》—— 合并两个排序链表

题目描述：
输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。
说明：本题目包含复杂数据结构ListNode，点此查看相关信息

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        if(pHead1 == nullptr)
        {
            return pHead2;
        }
        else if(pHead2 == nullptr)
        {
            return pHead1;
        }
        
        ListNode* Head = NULL;
        if(pHead1->val < pHead2->val)
        {
            Head = pHead1;
            pHead1 = pHead1->next;
        }
        else
        {
            Head = pHead2;
            pHead2 = pHead2->next;
        }
        ListNode* root = Head;
            
        while(pHead1 != nullptr &&　pHead2 != nullptr)
              {
                  if(pHead1->val < pHead2->val)
                  {
                      Head->next = pHead1;
                      pHead1 = pHead1->next;
                  }
                  else
                  {
                      Head->next = pHead2;
                      pHead2 = pHead2->next;
                  }
            Head = Head->next;
              }
        if(pHead1 == nullptr)
        {
            Head->next = pHead2;
        }
        else
        {
            Head->next = pHead1;
        }
        return root;
    }
};