链式存储

#include <stdio.h>
#include <malloc.h>
#include <conio.h>
#define EQUAL 1
#define ok 1
#define error 0
#define overflow -1
#define LIST_INIT_STZE 100
#define LISTINCREMENT 10
struct STU{
    char name[20];
    char stuno[10];
    int age;
    int score;
};
typedef struct STU elemtype;
struct LNODE
{
    elemtype data;
    struct LNODE *next;
};
typedef struct LNODE LNode;
typedef struct LNODE *linklist;

int Init(linklist *L)
{
    *L=(LNode *)malloc(sizeof(LNode));
    if(!L)
        exit(error);
    (*L)->next=NULL;
    return ok;
}

int ListLength (linklist L)
{
    int j=0;
    while (L->next)
        j++;
    return j;
}

int GetElem(linklist L,int i, elemtype *e)
{
    linklist p;
    int j;
    p=L->next;
    j=1;
    while(p&&j<i)
    {
        p=L->next;
        ++j;
    }
    if (!p&&j>1)
        return error;
    *e=p->data;
    return ok;
}

int EqualList(elemtype *e1,elemtype *e2)
{
    if(strcmp(e1->name,e2->name)==0)
        return 1;
    else
        return 0;
}

int Less_Equallist (elemtype *e1,elemtype *e2)
{
    if(strcmp(e1->name,e2->name)<=0)
        return 1;
    else
        return 0;
}

int LocateElem(linklist la,elemtype e,int type)
{
    int i;
    linklist p;
    p=la;
    switch(type)
    {
        case EQUAL:
            while(p->next)
            {
                p=p->next;
                if(EqualList(&p->data,&e))
                    return 1;
            }
            return 0;
        dafault:
            break;
    }
    return 0;
}

void MergeList (linklist la,linklist lb,linklist *lc)
{
    linklist pa;
    linklist pb;
    linklist pc;
    pa=la->next;
    pb=lb->next;
    pc=la;
    *lc=la;
    while(pa&&pb)
    {
        if (Less_Equallist(&pa->data,&pb->data))
        {
            pc->next=pa;
            pc=pa;
            pa=pa->next;
        }
        else
        {
            pa->next=pb;
            pc=pb;
            pb=pb->next;
        }
    }
    pc->next=pa?pa:pb;
    free(lb);
}

int PrintList (linklist L)
{
    int i;
    linklist p;
    p=L;
    printf("name stuno age score\n");
    while(p->next)
    {
        p=p->next;
        printf("%-10s%s\t%d\t%d\n",p->data.name,p->data.stuno,p->data.age,p->data.score);
        printf("\n");
    }
}

int ListInsert (linklist l,int i, elemtype e)
{
    linklist p,s;
    int j;
    p=l;
    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;
}

int main()
{
    struct STU e;
    linklist la,lb,lc;
    clrscr();
    printf("\n\n..................List Demo is running.........................\n\n");
    printf("First is Insertlist function .\n");
    Init(&la);
    strcpy(e.name,"stu1");
    strcpy(e.stuno,"100001");
    e.age=80;
    e.score=1000;
    ListInsert(la,1,e);
    strcpy(e.name,"stu3");
    strcpy(e.stuno,"100002");
    e.age=80;
    e.score=1000;
    ListInsert(la,2,e);
    PrintList(la);
    getch();
    Init(&lb);
    strcpy(e.name,"stu5");
    strcpy(e.stuno,"100003");
    e.age=80;
    e.score=1000;
    ListInsert(lb,1,e);
    strcpy(e.name,"stu6");
    strcpy(e.stuno,"100001");
    e.age=80;
    e.score=1000;
    ListInsert(lb,2,e);
    PrintList(lb);
    getch();
    MergeList(la,lb,&lc);
    PrintList(lc);
    getch();
}