SWUST OJ(954)

单链表的链接

#include <stdio.h>
#include <stdlib.h>

typedef struct LinkNode //单链表节点结构的定义
{
    char data;
    struct LinkNode *next;
}LinkNode;

void InitLinkList(LinkNode * &L)
{
    /*单链表的初始化*/
    L = (LinkNode*)malloc(sizeof(LinkNode));
    L->next = NULL;
}

void CreateLinkList(LinkNode *&L, int n,char *num)
{
    /*采用尾插法创建单链表*/
    LinkNode* r = L;
    for (int i = 0; i < n; ++i)
    {
        LinkNode * p =(LinkNode*)malloc(sizeof(LinkNode));
        p->data = num[i];
        p->next = r->next;
        r->next = p;
        r = p;
    }
}

void DisList(LinkNode *L)
{
    /*单链表的输出*/
    LinkNode *l = L->next;
    while(l)
    {
        printf("%c ",l->data);
        l = l->next;
    }
}

void MergeList(LinkNode *&L, LinkNode* L1)
{
    LinkNode * en = L;
    while(en->next)
    {
        en = en->next;
    }
    en->next = L1->next;
}


int main(int argc, char const *argv[])
{
    /*int n = 5;
    int num[]={1,2,3,4,5};*/
    int n, n1;
    char *num, *num1;

    scanf("%d",&n);
    num =(char*)malloc(n*sizeof(char));

    for (int i = 0; i < n; ++i)
    {
        scanf(" %c",&num[i]);
    }

    scanf("%d",&n1);
    num1 =(char*)malloc(n1*sizeof(char));

    for (int i = 0; i < n1; ++i)
    {
        scanf(" %c",&num1[i]);
    }

    LinkNode *L, *L1;
    InitLinkList(L);
    InitLinkList(L1);
    CreateLinkList(L,n,num);
    CreateLinkList(L1,n1,num1);
    MergeList(L,L1);
    DisList(L);
    return 0;
}