2024王道408 P39 T13

思考过程

        用两个指针p1和p2分别用来指向L1和L2的next域,然后把L1->next置空,之后再用一个指针r来防止断链。

先比较p1->data和p2->data哪个小,把小的用头插法插入到L1后,之后L2同理。

 最后如果p2已经把L2遍历完了但是L1中还有结点的话,就把指针p2=p1,之后再用一遍头插法把剩余元素插入L1中,最后把p2指针给free掉。

最后完整代码附上

#include "iostream"
struct node
{
    int data;
    struct node *next;
}*linklist;
int a1[3] = {1,2,7};
int a2[2] = {5,6};
int n = 3;
int m = 2;
void CreateList1(struct node *L1)
{
    struct node *s;
    struct node *r = L1;
    for (int i = 0; i < n; i++)
    {
        s = (struct node *)malloc(sizeof(struct node));
        s->data = a1[i];
        r->next = s;
        r = r->next;
    }
    s->next = NULL;
}
void CreateList2(struct node *L2)
{
    struct node *s;
    struct node *r = L2;
    for (int i = 0; i < m; i++)
    {
        s = (struct node *)malloc(sizeof(struct node));
        s->data = a2[i];
        r->next = s;
        r = r->next;
    }
    s->next = NULL;
}
void display(struct node *L1, struct node *L2)
{
    struct node *s = L1->next;
    struct node *r = L2->next;
    while (s)
    {
        printf("%d ", s->data);
        s = s->next;
    }
    printf("\n");
    while (r)
    {
        printf("%d ", r->data);
        r = r->next;
    }
    printf("\n");
}
void hebing(struct node *L1, struct node *L2)
{
    struct node *p1 = L1->next;
    struct node *p2 = L2->next;
    struct node *r;
    L1->next = NULL;
    while (p1 && p2)
    {
        if (p1->data <= p2->data)
        {
            r = p1->next;
            p1->next = L1->next;
            L1->next = p1;
            p1 = r;
        }
        else
        {
            r = p2->next;
            p2->next = L1->next;
            L1->next = p2;
            p2 = r;
        }
    }
    if (p1 != NULL) p2 = p1;
    while (p2)
    {
        r = p2->next;
        p2->next = L1->next;
        L1->next = p2;
        p2 = r;
    }
    free(p2);
}
int main()
{
    struct node *L1, *L2;
    CreateList1(L1);
    CreateList2(L2);
    display(L1, L2);
    hebing(L1, L2);
    display(L1, L2);
    return 0;
}

第一次写博客讲的不清楚见谅(代码中的L1和L2中的元素只是例子)

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值