将两个降序链表合并为一个新的 降序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。

输入例子1:

{6,3,2},{11,5,1}

输出例子1:

{11,6,5,3,2,1}

输入例子2:

{1},{}

输出例子2:

{1}

输入例子3:

{0},{0}

输出例子3:

{0,0}

说明：本题目包含复杂数据结构ListNode

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param list1 ListNode类 
     * @param list2 ListNode类 
     * @return ListNode类
     */
    ListNode* MergeTwoLists(ListNode* list1, ListNode* list2)
    {
        // write code here
        ListNode* NewList = NULL;
        if (list1 && list2)
        {
            if (list1->val > list2->val)
            {
                NewList = list1;
                list1 = list1->next;
            }
            else
            {
                NewList = list2;
                list2 = list2->next;
            }
        }
        ListNode* TmpList = NewList;

        while (list1 && list2)
        {
            if (list1->val > list2->val)
            {
                TmpList->next = list1;
                list1 = list1->next;
            }
            else
            {
                TmpList->next = list2;
                list2 = list2->next;
            }
            TmpList = TmpList->next;
        }
        while (list1)
        {
            TmpList->next = list1;
            list1 = list1->next;
            TmpList = TmpList->next;
        }
        while (list2)
        {
            TmpList->next = list2;
            list2 = list2->next;
            TmpList = TmpList->next;
        }
        return NewList;
    }
};