LeetCode21 合并两个有序链表

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

示例：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

/**
 * 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) {
        
        ListNode* dummyHead = new ListNode(-1);
        ListNode* p = dummyHead;
        ListNode* l1p = l1;
        ListNode* l2p = l2;
        
        while( l1p != NULL && l2p != NULL ){
            if( l1p->val <= l2p->val ){
                p->next = l1p;
                l1p = l1p->next;
            }
            else{
                p->next = l2p;
                l2p = l2p->next;
            }
            p = p->next;
        }
        
        if( l1p == NULL )
            p->next = l2p;
        if( l2p == NULL )
            p->next = l1p;
        
        ListNode* resHead = dummyHead->next;
        delete dummyHead;
        
        return resHead;
    }
};