实验三 单链表实现学生成绩管理系统

#include using namespace std; //template typedef int DataType; struct Node { DataType data; struct Node *next; }; //template class Linklist { public: Linklist(); Linklist(DataType a[],int n); ~Linklist(); int Length(); DataType Get(int i); int Locate(DataType x); void Insert(int i,DataType x); DataType Delete(int i); void Printlist(); private: struct Node *first; }; //template void Linklist::Printlist() { Node *p; int i=0; p=first->next; while(p!=NULL) { i=i+1; cout<<"第"<data<next; } } //template int Linklist::Length() { struct Node *p; p=first->next; int count=0; while(p!=NULL) { p=p->next; count++; } return count; } //template DataType Linklist::Get(int i) { struct Node *p; p=first->next; int count=1; while(p!=NULL&&countnext; count++; } if(p==NULL) cout<<"位置"<data< int Linklist::Locate(DataType x) { struct Node *p; p=first->next; int count=1; while(p!=NULL) { if(p->data==x)

{ cout<next; count++; } cout<<"无此成绩"< void Linklist::Insert(int i,DataType x) { struct Node *p,*s; p=first; int count=0; while(p!=NULL&&countnext; count++; } if(p==NULL) cout<<"位置"<data=x; s->next=p->next; p->next=s; } } //template Linklist::Linklist() { first=new Node; first->next=NULL; } //template Linklist::Linklist(DataType a[],int n) { struct Node *s; first=new Node; first->next=NULL; for(int i=0;idata=a[i]; s->next=first->next; first->next=s; } } //template DataType Linklist::Delete(int i) { struct Node *p,*q; p=first; int count=0,x; while(p!=NULL&&countnext; count++; } if(p==NULL||p->next==NULL) cout<<"位置"<next; x=q->data; p->next=q->next; delete q; return x; } return 0; } //template Linklist::~Linklist() { struct Node *q; while(first!=NULL) { q=first; first=first->next; delete q; } } //template int main() { cout<<"单链表实现学生成绩"<