21. Merge Two Sorted Lists

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

Summer_ZJU

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

阅读量327

点赞数

分类专栏：【LeetCode OJ】 leetcode 文章标签： 21 leetcode merge

本文链接：https://blog.csdn.net/xiaqunfeng123/article/details/52553993

版权

【LeetCode OJ】同时被 2 个专栏收录

38 篇文章 0 订阅

订阅专栏

leetcode

25 篇文章 1 订阅

订阅专栏

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.

原题链接：https://leetcode.com/problems/merge-two-sorted-lists/

思路
就遍历一遍，比较大小依次插入新链表。注意一下某一个链表为空的状态，或者先遍历完。

代码（C）

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) 
{
    struct ListNode *newhead = (struct ListNode *)malloc(sizeof(struct ListNode));
    if (NULL == newhead)
        return NULL;
    struct ListNode *rethead = newhead;

    if(l1 == NULL)
        return l2;
    if(l2 == NULL)
        return l1;

    while(l1 != NULL || l2 != NULL)
    {
        if(l1 == NULL)
        {
            newhead->next = l2;
            l2 = l2->next;
        }
        else if(l2 == NULL)
        {
            newhead->next = l1;
            l1 = l1->next;
        }
        else if(l1->val < l2->val)
        {
            newhead->next = l1;
            l1 = l1->next;
        }
        else 
        {
            newhead->next = l2;
            l2 = l2->next;
        }
        newhead = newhead->next;
    }
    return rethead->next;
}