单链表的相关操作

#include <stdio.h>
#include <string.h>
#include <malloc.h>
//#include "student.h"

struct student
{
    int num;
    char name[20];
    int score;
    struct student *next;
};

typedef enum _stu_flag_
{
    STU_NULL,
    STU_HEAD,
    STU_NUM,
    STU_SCORE,
    STU_END,
    STU_MAX
}stu_flag;

typedef enum _sort_flag_
{
    SORT_NULL,
    SORT_UP,
    SORT_DOWN,
    SORT_MAX
}sort_flag;

struct student *Input_StuData(void)
{
    struct student *head=NULL;
    struct student *pcurrent=NULL,*ptemp=NULL;
    int stu_num=0,n=0;

    do
    {
        printf("please input the number of student:");
        scanf("%d",&stu_num);
        if( stu_num == 0 )
            printf("sorry,the number is error!\n");
        else
            printf("\n");

    }while( stu_num == 0 );

    while( n<stu_num )
    {
        n=n+1;

        pcurrent=(struct student *)malloc(sizeof(struct student));
        if( pcurrent == NULL )
        {
            printf("malloc error!\n");
            break;
        }
        else
        {
            printf("input the number:\n");
            scanf("%d",&pcurrent->num);
            printf("input the name:\n");
            scanf("%s",pcurrent->name);
            printf("input the score:\n");
            scanf("%d",&pcurrent->score);
        }

        if( n == 1 )
            head=pcurrent;
        else
            ptemp->next=pcurrent;

        ptemp=pcurrent;
    }

    printf("input finished!\n");
    ptemp->next=NULL;
    return(head);
}

void Print_StuInfo(struct student *head)
{
    struct student *ptemp=NULL;

    if(head == NULL)
    {
        printf("no infomation to been printed,please check it!\n");
        return;
    }

    ptemp=head;
    while( ptemp!=NULL )
    {
        printf("num :%4d,name :%10s,score :%4d\n",ptemp->num,ptemp->name,ptemp->score);
        ptemp=ptemp->next;
    }

    return;
}

struct student *Delete_WithNum(struct student *head,int stu_num)
{
    struct student *pcurrent=NULL,*ptemp=NULL;

    if(head == NULL)
    {
        printf("no infomation to been printed,please check it!\n");
        return(NULL);
    }

    pcurrent=head;

    while( (stu_num!=pcurrent->num)&&(pcurrent->next!=NULL))
    {
        ptemp=pcurrent;
        pcurrent=pcurrent->next;
    }

    if( stu_num==pcurrent->num)
    {
        if(pcurrent == head)
            head=pcurrent->next;
        else
            ptemp->next=pcurrent->next;

        free(pcurrent);
        printf("we have deleted the num:%d\n",stu_num);
    }
    else
        printf("sorry,can not find the num:%d\n",stu_num);

    return(head);
}

/*if have the num,just update the student information*/
int Check_StuNum(struct student *head,struct student *stu_info)
{
    struct student *ptemp;

    for(ptemp=head;ptemp->next!=NULL;ptemp=ptemp->next)
    {
        if((ptemp->num)==(stu_info->num))
        {
            strcpy(ptemp->name,stu_info->name);
            ptemp->score=stu_info->score;
            return 1;
        }
    }

    return 0;
}

struct student *Add_2Head(struct student *head,struct student *stu_info)
{
    struct student *ptemp;

    if( Check_StuNum(head,stu_info) )
        return(head);

    ptemp=head;
    head=stu_info;
    stu_info->next=ptemp;

    return(head);
}

struct student *Add_2End(struct student *head,struct student *stu_info)
{
    struct student *ptemp;

    if( Check_StuNum(head,stu_info) )
        return(head);

    for(ptemp=head;ptemp->next!=NULL;ptemp=ptemp->next);

    ptemp->next=stu_info;
    stu_info->next=NULL;

    return(head);
}

struct student *Add_WithNum(struct student *head,struct student *stu_info)
{
    struct student *pcurrent=NULL,*ptemp=NULL,*pinsert=NULL;

    pcurrent=head;
    pinsert=stu_info;

    if( Check_StuNum(pcurrent,pinsert) )
        return(head);

    if( head==NULL)
    {
        head=pinsert;
        pinsert->next=NULL;
    }
    else
    {
        while((pinsert->num<pcurrent->num)&&(pcurrent->next!=NULL))
        {
            ptemp=pcurrent;
            pcurrent=pcurrent->next;
        }

        if(pinsert->num>=pcurrent->num)
        {
            if( head==pcurrent )
                head=pinsert;
            else
                ptemp->next=pinsert;

            pinsert->next=pcurrent;
        }
        else
        {
            pcurrent->next=pinsert;
            pinsert->next=NULL;
        }
    }

    return(head);
}

struct student *Add_WithScore(struct student *head,struct student *stu_info)
{
    struct student *pcurrent=NULL,*ptemp=NULL,*pinsert=NULL;

    pcurrent=head;
    pinsert=stu_info;

    if( Check_StuNum(pcurrent,pinsert) )
        return(head);

    if( head==NULL)
    {
        head=pinsert;
        pinsert->next=NULL;
    }
    else
    {
        while((pinsert->score>pcurrent->score)&&(pcurrent->next!=NULL))
        {
            ptemp=pcurrent;
            pcurrent=pcurrent->next;
        }

        if(pinsert->score<=pcurrent->score)
        {
            if(head==pcurrent)
                head=pinsert;
            else
                ptemp->next=pinsert;

            pinsert->next=pcurrent;
        }
        else
        {
            pcurrent->next=pinsert;
            pinsert->next=NULL;
        }
    }

    return(head);
}

/*flag: indicat which way to insert the student information*/
struct student *Add_StuInfo(struct student *head,struct student *stu_info,stu_flag flag)
{
    struct student *ptemp=NULL;

    if( stu_info == NULL )
    {
        printf("sorry,your information error,please check it!\n");
        return(NULL);
    }

    switch(flag)
    {
        case STU_HEAD:
            ptemp=Add_2Head(head,stu_info);
        break;

        case STU_NUM:
            ptemp=Add_WithNum(head,stu_info);
        break;

        case STU_SCORE:
            ptemp=Add_WithScore(head,stu_info);
        break;

        case STU_END:
            ptemp=Add_2End(head,stu_info);
        break;

        default:
            printf("error:flag %d\n",flag);
            return(NULL);
        break;
    }

    head=ptemp;
    return(head);
}

struct student *Sort_Up4Num(struct student *head)
{
    struct student *pcurrent=NULL,*pcompare=NULL,*pbig=NULL;
    int temp;
    char name[20];

    for(pcurrent=head;pcurrent->next!=NULL;pcurrent=pcurrent->next)
    {
        pbig=pcurrent;

        for(pcompare=pcurrent->next;pcompare;pcompare=pcompare->next)
        {
            if(pbig->num<pcompare->num)
                pbig=pcompare;
        }

        if( pbig!=pcurrent )
        {
            temp=pcurrent->num;
            pcurrent->num=pbig->num;
            pbig->num=temp;

            temp=pcurrent->score;
            pcurrent->score=pbig->score;
            pbig->score=temp;

            strcpy(name,pcurrent->name);
            strcpy(pcurrent->name,pbig->name);
            strcpy(pbig->name,name);
        }
    }

    return(head);
}

struct student *Sort_Down4Num(struct student *head)
{
    return(NULL);
}

/*flag: indicat how to sort*/
struct student *Sort_4Num(struct student *head,sort_flag flag)
{
    struct student *ptemp=NULL;

    switch(flag)
    {
        case SORT_UP:
            ptemp=Sort_Up4Num(head);
        break;

        case SORT_DOWN:
            ptemp=Sort_Down4Num(head);
        break;

        default:
            printf("error:flag %d\n",flag);
            return(NULL);
        break;
    }

    head=ptemp;
    return(head);
}

struct student *Sort_Up4Score(struct student *head)
{
    return(NULL);
}

struct student *Sort_Down4Score(struct student *head)
{
    return(NULL);
}

struct student *Sort_4Score(struct student *head,sort_flag flag)
{
    struct student *ptemp=NULL;

    switch(flag)
    {
        case SORT_UP:
            ptemp=Sort_Up4Score(head);
        break;

        case SORT_DOWN:
            ptemp=Sort_Down4Score(head);
        break;

        default:
            printf("error:flag %d\n",flag);
            return(NULL);
        break;
    }

    head=ptemp;
    return(head);
}

int main(int argc,char **argv)
{
    struct student *head=NULL,*stu_info=NULL;
    int stu_num;

    head=(struct student *)Input_StuData();
    head=Sort_4Num(head,SORT_UP);
    Print_StuInfo(head);

    printf("please input the delete number of student:\n");
    scanf("%d",&stu_num);
    head=Delete_WithNum(head,stu_num);
    Print_StuInfo(head);

    printf("please input the inset information:\n");
    stu_info=(struct student *)malloc(sizeof(struct student));
    printf("input the number:\n");
    scanf("%d",&stu_info->num);
    printf("input the name:\n");
    scanf("%s",stu_info->name);
    printf("input the score:\n");
    scanf("%d",&stu_info->score);
    head=Add_StuInfo(head,stu_info,STU_NUM);
    Print_StuInfo(head);

    return 0;
}

包含以下一些内容：

1、建立学生链表信息；2、增加或删除一个节点；3、排序

具体的一些api可编程验证！

 

 student_info.rar