单链表设计一个学生成绩系统

#include<iostream.h>
struct Node
{
    int number;
char* name;
char* Class;
float math_grade;
Node *next;
};
class Student
{
public:
Student();
Student(char*n[],char*c[],int num[],float m[],int l);
~Student();
void Insert(char*n,char*c,int num,float m,int l);//姓名,班级,学号,成绩
void Delete(int l);
void Locate(int l);
void Print();
private:
Node *first;
};


Student::Student()
{
Node *first=new Node;
first->next=NULL;
}
Student::~Student()
{
Node *q=NULL;
    while(first!=NULL)
{
q=first;
        first=first->next;
        delete q;
}
}
Student::Student(char*n[],char*c[],int num[],float m[],int l)
{
Node *s,*r;
first=new Node;
r=first;
for(int i=0;i<l;i++)
{
s=new Node;
s->name=n[i];
        s->Class=c[i];
        s->number=num[i];
        s->math_grade=m[i];
r->next=s;
r=s;
}
r->next=NULL;
 }
void Student::Insert(char*n,char*c,int num,float m,int l)
{
Node *r,*s;
    int count=0;
    r=first;
    while(r!=NULL&&count<l-1)
{
r=r->next;
        count++;
}
    if(r==NULL) cout<<"位置过大"<<endl;
    else
{
s=new Node;
        s->name=n;
        s->Class=c;
s->number=num;
s->math_grade=m;
        s->next=r->next;
        r->next=s;
}
}
void Student::Delete(int l)
 {

Node *r,*s;
    int count=0;
    r=first;
    while(r!=NULL&&count<l-1)
{
r=r->next;
        count++;
}
    if(r==NULL) cout<<"这个位置为空"<<endl;
    else
{
s=r->next;
        r->next=s->next;
cout<<s->name<<"的数据已被删除"<<endl;
        delete s;
}
}
void Student::Locate(int l)
{
Node *s;
    int count=0;
    s=first;
    while(s!=NULL)
{
s=s->next;
        count++;
}
if(s==NULL) cout<<"这个位置为空"<<endl;
    else
{
cout<<"第"<<l<<"位的数据为:"<<endl;
cout<<"姓名:"<<s->name<<endl;
cout<<"班级"<<s->Class<<endl;
cout<<"学号"<<s->number<<endl;
        cout<<"数学成绩"<<s->math_grade<<endl;
cout<<endl;
}
}
void Student::Print()
{
    Node *s;
s=first->next;
cout<<"姓名      班级      学号    数学成绩"<<endl;
    while(s!=NULL)
{
cout<<s->name<<"    ";
cout<<s->Class<<"    ";
cout<<s->number<<"     ";
cout<<s->math_grade<<endl;
s=s->next;
}
}

int main()
{
int p;
int y;
float z;
    char x[5];
char r[10];
char*n[4]={"小明","小红","小花","小青"};
char*c[4]={"信管1171","信管1172","计科1171","信管1161"};
int num[4]={2011,2012,2014,2017};
float m[4]={80,90,100,89.5};
Student a(n,c,num,m,4);
    cout<<"录入的数据为:"<<endl;
    a.Print();
cout<<endl;
cout<<"插入数据"<<endl;
cout<<endl;
    cout<<"输入你要列入的姓名:";
    cin>>x;
    cout<<"输入你要列入的班级:";
    cin>>r;
cout<<"输入你要列入的学号:";
    cin>>y;
cout<<"输入你要列入的数学成绩:";
    cin>>z;
    cout<<"输入你要列入的位置:";
cin>>p;
cout<<endl;
a.Insert(x,r,y,z,p);
a.Print();
cout<<endl;
cout<<"要删除的位置:";
cin>>p;
a.Delete(p);
cout<<endl;
cout<<"要查找的数据的位置:";
cin>>p; 
a.Locate(p);
cout<<endl;
cout<<"各成员数据如下:"<<endl;
a.Print();
    return 0;

}

运行结果:







猜你喜欢

转载自blog.csdn.net/Air_JQM/article/details/80168644