# MarkManager

**Repository Path**: ming4j/MarkManager

## Basic Information

- **Project Name**: MarkManager
- **Description**: C 语言链表实现的学生成绩管理
- **Primary Language**: C
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2021-02-06
- **Last Updated**: 2021-02-06

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# 1. 基于动态链表的学生成绩管理系统
## 1.1. 数据集
>学生成绩管理系统，可以抽象为两个实体。
- 学生（Student）
- 成绩（Mark）
## 1.2. 数据元素
- 如下图所示
![](http://p7ddollt8.bkt.clouddn.com/18-11-15/98391104.jpg)
## 1.3. 逻辑结构
- 如下图所示
![](http://p7ddollt8.bkt.clouddn.com/18-11-15/80597056.jpg)
## 1.4. 功能实现
- 输入学生信息
```
DN InputStudent(DN phead);
```
- 输入成绩信息
```
PMNODE InputMarkInfo(PMNODE mhead);
```
- 输出操作
```
void OutputStudent(DN pHead);
void OutputMarkInfo(PMNODE pHead);
void OutputMarkDetail(DN pHead);
```
- 插入学生信息
```
void InsertStudent(DN pHead);
```
- 插入成绩信息
```
void InsertMark(PMNODE mhead);
```
- 删除学生信息
```
void DeleteStudent(DN pHead);
```
- 修改学生信息
```
void ChangeStudent(DN pHead);
```
- 修改成绩信息
```
void ChangeStudentMark(DN pHead);
```
- 排序
    - 按AVG排序
    ```
    void ScortByAVG(DN pHead);
    ```
    - 按SUM排序
    ```
    void ScortBySUM(DN pHead);
    ```
    - 按各科成绩排序
    ```
    void ScortByClass(DN pHead, char name[20]);
    ```
## 1.5. 数据结构设计
### 1.5.1. Student
```
struct Student {
    int tempId;//自增ID
    char No[13];//学生学号
    char Name[10];//学生姓名
    char Sex[4];//学生性别
    char Class[20];//学生班级
    char Tel[11];//学生电话
};
```
### 1.5.2. Mark
```
struct Mark{
    char ClassName[20];//课程名称
    float ClassMark;//课程成绩
};
```
## 1.6. 储存结构设计
### 1.6.1. Student
```
typedef struct StudentNode{
    struct StudentNode *UP; //前指针
    struct Student student; //学生数据
    float Total;//成绩总分
    float Avg;//成绩平均分
    struct MarkNode *SMN;//成绩信息指针
    struct StudentNode *DOWN;//后指针
}SNODE,*DN;
```
### 1.6.2. Mark
```
typedef struct MarkNode{
    struct Mark mark;//成绩数据
    struct MarkNode *D;//下指针
}MNODE,*PMNODE;
```

## 1.7. 设计算法
### 1.7.1. NodeCopy
> 只说我程序中的一个亮点，排序等算法我认为并没有什么可说的，因为设计数据结构时，考虑到学生与成绩之间的关系为1:N的关系，故必须在每个新的学生节点后面挂载成绩链表，借鉴Java语言的new关键字，每new一个对象开辟一个内存空间的原则，进行设计。此函数可以复制一个新的且为空的Mark节点。
```
PMNODE MarkNodeCopy(PMNODE mhead){
    PMNODE h,a;
   if(mhead == NULL){
       printf("复制的链表是空的");
       return NULL;
   }else if(mhead->D==NULL){
       printf("复制的链表是空的");
       return NULL;
   }
   h=a=(PMNODE)malloc(sizeof(MNODE));
   a->D=(PMNODE)malloc(sizeof(MNODE));
   a=a->D;
   while (1){
       strcpy(a->mark.ClassName,mhead->mark.ClassName);
       a->mark.ClassMark=0;
       if(mhead->D!=NULL){
           mhead=mhead->D;
           a->D=(PMNODE)malloc(sizeof(MNODE));
           a=a->D;
       } else{
           a->D=NULL;
           break;
       }
   }
    return h;

}
```
## 1.8. 实现
[GitHub链接](https://github.com/MiniManMing/MarkManager)
```
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//学生数据结构封装
struct Student {
    int tempId;//自增ID
    char No[13];//学生学号
    char Name[10];//学生姓名
    char Sex[4];//学生性别
    char Class[20];//学生班级
    char Tel[11];//学生电话
};
//成绩数据结构封装
struct Mark{
    char ClassName[20];//课程名称
    float ClassMark;//课程成绩
};
//学生节点结构
typedef struct StudentNode{
    struct StudentNode *UP; //前指针
    struct Student student; //学生数据
    float Total;//成绩总分
    float Avg;//成绩平均分
    struct MarkNode *SMN;
    struct StudentNode *DOWN;//后指针
}SNODE,*UN,*DN;
//成绩节点结构
typedef struct MarkNode{
    struct Mark mark;//成绩数据
    struct MarkNode *D;//下指针
}MNODE,*PMNODE;
//检查Y？N
int checkExit(char c){
    if('Y'==c||'y'==c)
        return 1;
    else
        return 0;
}
DN CreateList(void){
    DN phead =(DN)malloc(sizeof(SNODE));
    if(NULL == phead)
    {
        printf("内存分配失败,程序终止!\n");

        exit(-1);
    }
    return phead;

}
PMNODE CreateMark(void){
    PMNODE mhead =(PMNODE)malloc(sizeof(MNODE));
    if(NULL == mhead)
    {
        printf("内存分配失败,程序终止!\n");

        exit(-1);
    }
    return mhead;
}
PMNODE InputMarkInfo(PMNODE mhead){
    MNODE mark;
    if(NULL == mhead){
        printf("请执行初始化命令\n");
    }else{
        printf("欢迎进入成绩录入系统确认按Y退出按N(Y?N)\n");
        char c;
        scanf("%s",&c);
        if(checkExit(c)){
            PMNODE ptail=mhead;
            ptail->D=NULL;
            for(int i=0;;i++){
                system("cls");//清屏
                printf("请输入第%d门课的名字:", i+1);
                scanf("%s", mark.mark.ClassName);
                printf("继续按Y退出按N(Y?N)\n");
                char s;
                scanf("%s",&s);
                if(checkExit(s)){
                    PMNODE mnew =(PMNODE)malloc(sizeof(MNODE));
                    if(NULL == mnew)
                    {
                        printf("内存分配失败,程序终止!\n");

                        exit(-1);
                    }
                    mnew->mark=mark.mark;
                    ptail->D=mnew;
                    mnew->D=NULL;
                    ptail=mnew;
                } else{
                    PMNODE emnew =(PMNODE)malloc(sizeof(MNODE));
                    if(NULL == emnew)
                    {
                        printf("内存分配失败,程序终止!\n");

                        exit(-1);
                    }
                    emnew->mark=mark.mark;
                    ptail->D=emnew;
                    emnew->D=NULL;
                    return mhead;
                }
            }
        }
    }
}
PMNODE MarkNodeCopy(PMNODE mhead){
    PMNODE h,a;
   if(mhead == NULL){
       printf("复制的链表是空的");
       return NULL;
   }else if(mhead->D==NULL){
       printf("复制的链表是空的");
       return NULL;
   }
   h=a=(PMNODE)malloc(sizeof(MNODE));
   a->D=(PMNODE)malloc(sizeof(MNODE));
   a=a->D;
   while (1){
       strcpy(a->mark.ClassName,mhead->mark.ClassName);
       a->mark.ClassMark=0;
       if(mhead->D!=NULL){
           mhead=mhead->D;
           a->D=(PMNODE)malloc(sizeof(MNODE));
           a=a->D;
       } else{
           a->D=NULL;
           break;
       }
   }
    return h;

}
DN InputStudent(DN phead){
        SNODE stu;
        if(NULL == phead){
            printf("请执行初始化命令\n");
        } else{
            printf("欢迎进入学生录入系统确认按Y退出按N(Y?N)\n");
            char c;
            scanf("%s",&c);
            if(checkExit(c)){
                DN ptail = phead;
                ptail->DOWN=NULL;
                for(int i=0;;i++){
                    system("cls");//清屏
                    stu.student.tempId=i+1;
                    printf("请输入第%d个学生的学号:\n", i+1);
                    scanf("%s", stu.student.No);
                    printf("请输入第%d个学生的姓名:\n", i+1);
                    scanf("%s", stu.student.Name);
                    printf("请输入第%d个学生的性别:\n", i+1);
                    scanf("%s", stu.student.Sex);
                    printf("请输入第%d个学生的班级:\n", i+1);
                    scanf("%s", stu.student.Class);
                    printf("请输入第%d个学生的电话\n", i+1);
                    scanf("%s", stu.student.Tel);
                    printf("继续按Y退出按N(Y?N)\n");
                    char s;
                    scanf("%s",&s);
                    if(checkExit(s)){
                        DN pnew=(DN)malloc(sizeof(SNODE));
                        if(NULL == pnew)
                        {
                            printf("内存分配失败,程序终止!\n");

                            exit(-1);
                        }
                        pnew->student=stu.student;
                        ptail->DOWN=pnew;
                        pnew->UP=ptail;
                        pnew->DOWN=NULL;
                        ptail=pnew;

                    } else{
                        DN epnew=(DN)malloc(sizeof(SNODE));
                        if(NULL == epnew)
                        {
                            printf("内存分配失败,程序终止!\n");

                            exit(-1);
                        }
                        epnew->student=stu.student;
                        ptail->DOWN=epnew;
                        epnew->UP=ptail;
                        epnew->DOWN=NULL;
                        return phead;
                    }
                }
            }

        }
}
void OutputStudentToolOfMark(DN pHead)
{
    //定义一个指针用于遍历学生信息

    int count=1;
    printf("ID   学号  姓名\n");

    while(NULL != pHead)
    {
        printf("%d  %s  %s       ", pHead->student.tempId, pHead->student.No, pHead->student.Name);
        pHead = pHead->DOWN;
        count++;
        if(count>5){
            printf("\n");
            count=1;
        }

    }


}
DN InputStudentMark(DN pHead,PMNODE mHead){
    if(pHead==NULL||mHead==NULL){
        printf("没有学生或课程数据请录入\n");
        return 0;
    }
    DN pp=pHead->DOWN;
    DN re=pp;
   while (1){
       int i=0;
       DN p=pHead->DOWN;
       OutputStudentToolOfMark(p);
       printf("请输入你要录入成绩的学生序号:\n");
       scanf("%d",&i);
       while (p!=NULL){
           if(p->student.tempId==i){
               PMNODE copy=MarkNodeCopy(mHead);
               PMNODE mp=copy->D->D;
               int mcount=0;
               float sum=0;
               while (mp!=NULL){
                   int flag=1;
                   while(flag){
                       printf("请输入%s的%s成绩:\n",p->student.Name,mp->mark.ClassName);
                       float mark;
                       scanf("%f",&mark);
                       if(mark>=0&&mark<=100){
                           mp->mark.ClassMark=mark;
                           sum=sum+mark;
                           mcount++;
                           flag=0;
                       }else{
                           printf("成绩校验失败！请重新输入！\n");
                       }

                   }
                   mp=mp->D;
               }
               p->Total=sum;
               p->Avg=sum/mcount;
               p->SMN=copy->D->D;
               //printf("%.1f %.1f",p->Total,p->Avg);
               //printf("%s,%f",p->SMN->mark.ClassName,p->SMN->mark.ClassMark);
           }
           p=p->DOWN;
       }
       printf("继续请按Y退出按N(Y?N)\n");
       char c;
       scanf("%s",&c);
       if(checkExit(c)){
           continue;
       } else{
           return re;
       }
   }


}
void OutputStudent(DN pHead)
{
    //定义一个指针用于遍历学生信息
    DN p = pHead->DOWN;

    printf("ID 学号  姓名  性别  班级  电话\n");

    while(NULL != p)
    {
        printf("%d  %s  %s  %s  %s  %s\n", p->student.tempId, p->student.No, p->student.Name, p->student.Sex, p->student.Class, p->student.Tel);

        p = p->DOWN;

    }


}
void OutputMarkInfo(PMNODE pHead)
{
    //定义一个指针用于遍历学生信息
    PMNODE p = pHead->D->D;

    printf("课程名\n");

    while(NULL != p)
    {
        printf("%s  \n", p->mark.ClassName);

        p = p->D;

    }


}
void OutputMark(PMNODE pHead)
{
    PMNODE p = pHead->D;

    printf("课程名\n");

    while(NULL != p)
    {
        printf("%s  \n", p->mark.ClassName);

        p = p->D;

    }


}
void OutputMarkDetail(DN pHead){
    DN p=pHead;
    while (NULL !=p){
        printf("ID         学号         姓名         总分         平均分\n");
        printf("%d          %s          %s          %.1f          %.1f\n",p->student.tempId,p->student.No,p->student.Name,p->Total,p->Avg);
     PMNODE m=p->SMN;
        while(NULL !=m){
            printf("%s:          %.1f\n",m->mark.ClassName,m->mark.ClassMark);
            m=m->D;
        }
        p=p->DOWN;
    }
}
void OutputOrderByMarkDetail(DN pHead){
    DN p=pHead->DOWN;
    while (NULL !=p){
        printf("ID         学号         姓名\n");
        printf("%d          %s          %s\n",p->student.tempId,p->student.No,p->student.Name);
        p=p->DOWN;
    }
}
void DeleteStudent(DN pHead){
    OutputStudent(pHead);
    DN temp;
    DN d=pHead;
    printf("请输入你要删除的学生的ID:\n");
    int flag=0;
    scanf("%d",&flag);
    while(NULL!=d->DOWN){
        if(flag==d->student.tempId){
            DN t=d->DOWN;
            DN h=d->UP;
            h->DOWN=t;
            t->UP=h;
            temp=t;
            free(d);
        }
        d=d->DOWN;
    }
    while (temp!=NULL){
        temp->student.tempId--;
        temp=temp->DOWN;
    }

    OutputStudent(pHead);

}
void InsertStudent(DN pHead){
    OutputStudent(pHead);
    printf("请输入你要插入的位置！\n");
    int flag=0;
    scanf("%d",&flag);
    DN pnew=(DN)malloc(sizeof(SNODE));
    DN temp=pHead;
    while (NULL!=temp->DOWN){
        if(temp->student.tempId==flag){
            SNODE stu;
            stu.student.tempId=flag;
            printf("请输入第%d个学生的学号:\n", flag);
            scanf("%s", stu.student.No);
            printf("请输入第%d个学生的姓名:\n", flag);
            scanf("%s", stu.student.Name);
            printf("请输入第%d个学生的性别:\n", flag);
            scanf("%s", stu.student.Sex);
            printf("请输入第%d个学生的班级:\n", flag);
            scanf("%s", stu.student.Class);
            printf("请输入第%d个学生的电话\n", flag);
            scanf("%s", stu.student.Tel);
            pnew->student=stu.student;
            DN d=temp->DOWN;
            DN u=temp->UP;
            u->DOWN=pnew;
            pnew->UP=u;
            pnew->DOWN=temp;
            temp->UP=pnew;
            while (NULL!=pnew->DOWN){
                pnew->DOWN->student.tempId++;
                pnew=pnew->DOWN;
            }
        }
        temp=temp->DOWN;
    }
    OutputStudent(pHead);
}
void InsertMark(PMNODE mhead){

    while (NULL!=mhead){
        if(mhead->D==NULL){
            PMNODE pnew=(PMNODE)malloc(sizeof(MNODE));
            MNODE mnode;
            printf("请输入课程名称:\n");
            scanf("%s", mnode.mark.ClassName);
            pnew->mark=mnode.mark;
            pnew->D=NULL;
            printf("%s",mhead->mark.ClassName);
            mhead->D=pnew;
            printf("继续请按Y退出按N(Y?N)\n");
            char c;
            scanf("%s",&c);
            if(checkExit(c)){
                continue;
            } else{
                break;
            }

        }
        mhead=mhead->D;
    }
}
void ChangeStudent(DN pHead){
    OutputMarkDetail(pHead->DOWN);
    printf("请输入要修改的学生的ID\n");
    int tempId;
    scanf("%d",&tempId);
    while(pHead!=NULL){
        if(pHead->student.tempId==tempId){
            printf("请输入第%d个学生的学号:\n", pHead->student.tempId);
            scanf("%s", pHead->student.No);
            printf("请输入第%d个学生的姓名:\n", pHead->student.tempId);
            scanf("%s", pHead->student.Name);
            printf("请输入第%d个学生的性别:\n", pHead->student.tempId);
            scanf("%s", pHead->student.Sex);
            printf("请输入第%d个学生的班级:\n", pHead->student.tempId);
            scanf("%s", pHead->student.Class);
            printf("请输入第%d个学生的电话\n", pHead->student.tempId);
            scanf("%s", pHead->student.Tel);
            printf("是否要修改成绩信息确认按Y退出按N(Y?N)\n");
            char ch;
            scanf("%s",&ch);
            if(checkExit(ch)){
                PMNODE pm=pHead->SMN;
                int count=0;
                float sum=0;
                while (pm!=NULL){
                    printf("请输入%s的%s成绩\n",pHead->student.Name,pm->mark.ClassName);
                    scanf("%f",&pm->mark.ClassMark);
                    count++;
                    sum=sum+pm->mark.ClassMark;
                    pm=pm->D;
                }
                pHead->Total=sum;
                pHead->Avg=sum/count;
                printf("修改完成！\n");
            }
        }
        pHead=pHead->DOWN;
    }

}
void ScortByAVG(DN pHead) {
    DN p, q;//定义两个指针

    SNODE temp;

    for (p = pHead->DOWN; NULL != p; p = p->DOWN) {
        for (q = p->DOWN; NULL != q; q = q->DOWN) {
            if (p->Avg < q->Avg)//当前一个学生的语文成绩小于后一个学生的语文成绩时
            {
                printf("%.1f<%.1f\n",p->Avg,q->Avg);
                temp.student = p->student;//交换学生的位置
                p->student = q->student;
                q->student = temp.student;
            }
        }
    }
}
void ScortBySUM(DN pHead) {
    DN p, q;//定义两个指针

    SNODE temp;

    for (p = pHead->DOWN; NULL != p; p = p->DOWN) {
        for (q = p->DOWN; NULL != q; q = q->DOWN) {
            if (p->Total < q->Total)//当前一个学生的语文成绩小于后一个学生的语文成绩时
            {
                printf("%.1f<%.1f\n",p->Total,q->Total);
                temp.student = p->student;//交换学生的位置
                p->student = q->student;
                q->student = temp.student;
            }
        }
    }
}
void ScortByClass(DN pHead, char name[20]) {
    DN p, q;//定义两个指针
    PMNODE d,b;
    SNODE temp;
    printf("%s", name);
    for (p = pHead->DOWN; NULL != p; p = p->DOWN) {
        for (q = p->DOWN; NULL != q; q = q->DOWN) {
            for(d=p->SMN;NULL!=d;d=d->D){
                for(b=q->SMN;NULL!=b;b=b->D){
//                    printf("传入%s",name);
//                    printf("flag：1\n");
//                    printf("d的%s\n",d->mark.ClassName);
//                    printf("b的%s\n",b->mark.ClassName);
//                    printf("flag：3%d",strcmp(d->mark.ClassName,name));
//                    printf("flag：4%d",strcmp(b->mark.ClassName,name));
                    if(strcmp(d->mark.ClassName,name)==0&&strcmp(b->mark.ClassName,name)==0){
                       // printf("2\n");
                        if(d->mark.ClassMark < b->mark.ClassMark){
                           // printf("3\n");
                           // printf("%.1f < %.1f\n",d->mark.ClassMark,b->mark.ClassMark);
                            temp.student = p->student;//交换学生的位置
                            p->student = q->student;
                            q->student = temp.student;

                        }
                    }

                }
            }


        }



    }
}
void UnityOrderBy(DN pHead){
    PMNODE pmnode=pHead->DOWN->SMN;
    int i=0;
    int k=1;
    printf("这是一个通用排序，请输入依照什么排序\n");
    printf("---1.综合排序---\n");
    printf("---2.科目排序---\n");
    scanf("%d",&i);
    switch(i){
        case 1:
        {
            printf("-----1.AVG-----\n");
            printf("-----2.SUM-----\n");
            int j=0;
            scanf("%d",&j);
            if(j==1){
                ScortByAVG(pHead);
                OutputOrderByMarkDetail(pHead);
            } else if(j==2){
                ScortBySUM(pHead);
                OutputOrderByMarkDetail(pHead);
            }
        }

            break;
        case 2:
        {
            while (pmnode!=NULL){
                printf("-----%d.%s-----\n",k,pmnode->mark.ClassName);
                k++;
                pmnode=pmnode->D;
            }
            printf("请输入要排序的课名\n");
            char mname [20] ;
            scanf("%s",mname);
            ScortByClass(pHead,mname);
            OutputOrderByMarkDetail(pHead);
        }
            break;


    }

    }
DN CreateList(void);
DN InputStudent(DN phead);
void OutputMarkInfo(PMNODE pHead);
PMNODE CreateMark(void);
PMNODE MarkNodeCopy(PMNODE mhead);
DN InputStudentMark(DN pHead,PMNODE mHead);
void OutputMarkDetail(DN pHead);
void ChangeStudent(DN pHead);
void main(){
    DN p =CreateList();
    p=InputStudent(p);
    OutputStudent(p);
    DeleteStudent(p);
    InsertStudent(p);
    OutputStudent(p);
    PMNODE pm=CreateMark();
    pm=InputMarkInfo(pm);
    DN pp=InputStudentMark(p,pm);
    OutputMarkDetail(pp);
    OutputMark(pm);
    UnityOrderBy(p);
    ChangeStudent(p);
    OutputStudent(p);
}
```