合并两个链表算法分割故障C++

#include <iostream>

struct ListNode {
    int val;
    ListNode* next;
    ListNode(int x) : val(x), next(nullptr) {}
};

ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
    if (l1 == nullptr) {
        return l2;
    }
    if (l2 == nullptr) {
        return l1;
    }
    
    ListNode* dummy = new ListNode(0);
    ListNode* curr = dummy;
    
    while (l1 != nullptr && l2 != nullptr) {
        if (l1->val <= l2->val) {
            curr->next = l1;
            l1 = l1->next;
        } else {
            curr->next = l2;
            l2 = l2->next;
        }
        curr = curr->next;
    }
    
    if (l1 != nullptr) {
        curr->next = l1;
    }
    if (l2 != nullptr) {
        curr->next = l2;
    }
    
    ListNode* result = dummy->next;
    delete dummy;
    
    return result;
}

int main() {
    // 创建链表1: 1 -> 2 -> 4
    ListNode* l1 = new ListNode(1);
    l1->next = new ListNode(2);
    l1->next->next = new ListNode(4);
    
    // 创建链表2: 1 -> 3 -> 4
    ListNode* l2 = new ListNode(1);
    l2->next = new ListNode(3);
    l2->next->next = new ListNode(4);
    
    // 合并两个链表
    ListNode* mergedList = mergeTwoLists(l1, l2);
    
    // 输出合并后的链表: 1 -> 1 -> 2 -> 3 -> 4 -> 4
    ListNode* curr = mergedList;
    while (curr != nullptr) {
        std::cout << curr->val << " ";
        curr = curr->next;
    }
    
    // 释放内存
    delete l1;
    delete l2;
    delete mergedList;
    
    return 0;
}