leetcode[21]:Merge Two Sorted Lists

最新推荐文章于 2024-01-12 14:30:52 发布

hahubaba

最新推荐文章于 2024-01-12 14:30:52 发布

阅读量219

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： list

本文链接：https://blog.youkuaiyun.com/hahubaba/article/details/46402363

leetcode 专栏收录该内容

86 篇文章

订阅专栏

本文介绍了如何将两个已排序的链表合并成一个有序链表，并提供了详细步骤及代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
    struct ListNode *L, *tmp;
    if(l1 == NULL ) return l2;
    if(l2 == NULL ) return l1;
    L=l1;
    while(1)
    {
        if(L->val > l2->val)
        {
            tmp = ( struct ListNode* ) malloc( sizeof( struct ListNode* ) );
            tmp->val = l2->val;
            tmp->next = l1;
            l1 = tmp;
            L=l1;
            l2 = l2->next;
        }
        else 
        {
            if( L->next == NULL )
            {
                L->next=l2;
                return l1;
            }
            if( L->next->val < l2->val)
            {

                L = L->next;
            }
            else {
                tmp = ( struct ListNode* ) malloc( sizeof( struct ListNode* ) );
                tmp->val = l2->val;
                tmp->next = L->next;
                L->next = tmp;
                l2 = l2->next;
                L = L->next;
            }
        }
        if (l2 == NULL) break;
    }
return l1;
}