合并两个排序的链表

题目描述

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

思路：我们新建一条链表，把需要排序的两条链表(A1,A2)从头开始排序，A1的头部与A2的头部比较，谁小，插入到新的链表中，继续比较A1下一个节点与A2头部，谁小插入到新链表，往后移动一位。往复如此。

/*
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(0);
        ListNode* p = head;
       
        
        int x1,x2;
        while(pHead1 != NULL || pHead2 != NULL)
        {
            
            if(pHead1 != NULL && pHead2 != NULL)
            {
                x1 = pHead1->val;
                x2 = pHead2->val;
               
                if(x1 > x2)
                {
                    p->next = pHead2;
                    pHead2 = pHead2->next;
                    p = p->next;
                }
                else
                {
                    p->next = pHead1;
                    pHead1 = pHead1->next;
                    p = p->next;
                }
            }
            else if(pHead1 == NULL)
            {
                p->next = pHead2;
                pHead2 = pHead2->next;
                p = p->next;
            }
            else if(pHead2 == NULL)
            {
                p->next = pHead1;
                pHead1 = pHead1->next;
                p = p->next;
            }
            
        }
        
        return head->next;
    }
};