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

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        if(l1)
        {
            while(l2)
            {
                ListNode *pNew = new ListNode(l2->val);
                ListNode *l3 = l1;
                while(l3)
                {
                    if(l3->val <= l2->val)
                    {
                        if(l3->next==NULL)
                        {
                            pNew->next = l3->next;
                            l3->next = pNew;
                            break;
                        }
                        else if(l3->next->val >= l2->val)
                        {
                            pNew->next = l3->next;
                            l3->next = pNew;
                            break;
                        }
                        else
                            l3 = l3->next;
                            continue;
                    }
                    else
                    {
                        pNew->next = l3;
                        l1 = pNew;                        
                        break;
                    }                 
                }
                l2 = l2->next;
            }
            return l1;
        }
        else if(l2)
            return l2;
        else
            return NULL;
    }
};