合并有序链表到新的链表，并分别输出三条链表

Question

合并顺序链表，为什么 我的三个链表输出的值都不对？

```c
#include <stdio.h>
#include <malloc.h>

#define ERROR 0
#define OK 1
#define ElemType int

typedef int Status;
typedef struct LNode
{
    int data;
    struct LNode *next;
} LNode, *LinkList;

Status ListInsert_L(LinkList &L, int i, ElemType e)
{
    LinkList p, s;
    p = L;
    int j = 0;
    while (p && j < i - 1)
    {
        p = p->next;
        ++j;
    }
    if (!p || j > i - 1)
        return ERROR;
    s = (LinkList)malloc(sizeof(LNode));
    s->data = e;
    s->next = p->next;
    p->next = s;
    return OK;
}

LinkList MergeLists(LinkList A, LinkList B,LinkList C)
{

    LinkList p = A->next;
    LinkList q = B->next;
    LinkList r = C;

    while (p && q)
    {
        if (p->data <= q->data)
        {
            r->next = p;
            p = p->next;
        }
        else
        {
            r->next = q;
            q = q->next;
        }
        r = r->next;
    }

    r->next = p ? p : q;

    return C;
}

void PrintList(LinkList L, const char* listName)
{
    printf("List %s:", listName);
    L = L->next;
    while (L)
    {
        printf("%d ", L->data);
        L = L->next;
    }
    printf("\n");
}

int main()
{
    LinkList A = (LinkList)malloc(sizeof(LNode));
    A->next = NULL;
    int n1,n2, num;
    scanf("%d", &n1);
    for (int i = 0; i < n1; i++)
    {
        scanf("%d", &num);
        ListInsert_L(A, i, num);
    }

    LinkList B = (LinkList)malloc(sizeof(LNode));
    B->next = NULL;
    scanf("%d", &n2);
    for (int i = 0; i < n2; i++)
    {
        scanf("%d", &num);
        ListInsert_L(B, i, num);
    }
    LinkList C = (LinkList)malloc((n1+n2)*sizeof(LNode));
    C->next=NULL;
     C = MergeLists(A, B,C);

    PrintList(A, "A");
    PrintList(B, "B");
    PrintList(C, "C");

    return 0;
}

```

Answer 1

#include <stdio.h>
#include <malloc.h>
#define ERROR 0
#define OK 1
#define ElemType int

typedef int Status;
typedef struct LNode
{
    int data;
    struct LNode *next;
} LNode, *LinkList;

Status ListInsert_L(LinkList &L, int i, ElemType e)
{
    LinkList p, s;
    p = L;
    int j = 0;
    while (p && j < i - 1)
    {
        p = p->next;
        ++j;
    }
    if (!p || j > i - 1)
        return ERROR;
    s = (LinkList)malloc(sizeof(LNode));
    s->data = e;
    s->next = p->next;
    p->next = s;
    return OK;
}

LinkList MergeLists(LinkList A, LinkList B,LinkList C)
{

    LinkList p = A->next;
    LinkList q = B->next;
    LinkList r = C;

    while (p && q)
    {
        if (p->data <= q->data)
        {
            r->next = p;
            p = p->next;
        }
        else
        {
            r->next = q;
            q = q->next;
        }
        r = r->next;
    }

    r->next = p ? p : q;

    return C;
}

void PrintList(LinkList L, const char* listName)
{
    printf("List %s:", listName);
    L=L->next;
    while (L)
    {
        printf("%d ", L->data);
        L = L->next;
    }
    printf("\n");
}

int main()
{
    LinkList A = (LinkList)malloc(sizeof(LNode));
    A->next = NULL;
    int n1,n2, num;
    scanf("%d", &n1);
    for (int i = 1; i <= n1; i++)
    {
        scanf("%d", &num);
        ListInsert_L(A, i, num);
    }
     PrintList(A, "A");
    LinkList B = (LinkList)malloc(sizeof(LNode));
    B->next = NULL;
    scanf("%d", &n2);
    for (int i = 1; i <=n2; i++)
    {
        scanf("%d", &num);
        ListInsert_L(B, i, num);
    }
    PrintList(B, "B");
    LinkList C = (LinkList)malloc((n1+n2)*sizeof(LNode));
    LinkList D;
     D= MergeLists(A, B,C);
    PrintList(D, "C");

    return 0;
}

答案错误是因为插入的位置不对，应该是1到链表长度。