学生类链表.cpp

雅可比迭代等一些程序

#include<iostream.h>
#include<windows.h>
class student{
private:int num,grade;
student *next,*last,*newnode;
char name[10];
static int amount;
static student *first;
public:student* create();
void disp();
}; //类的声明

student* student::create()
{int i=1;
while(i<=amount)
{cout<<"第"<<i<<"个节点 ";
cin>>num>>name>>grade;
newnode=new student;
newnode->num=num;
strcpy(newnode->name,name);
newnode->grade=grade;
if(first==NULL)
{first=newnode;
last=newnode;
}
else{last->next=newnode;
last=newnode;
last->next=NULL;  //链表中最后结点的下一个指针应置空。
}
i++;
}return first;
} //插入节点的成员函数
void student::disp()
{cout<<"显示链表\n";
while(first!=NULL)
{cout<<first->num<<" "<<first->name<<" "<<first->grade<<endl;
first=first->next;}
} //显示链表内容
student* student::first=NULL;
int student::amount=5;//静态成员初始化

void main()
{student a;
cout<<"//用对象指针处理学生信息链表//"<<endl;
cout<<"输入学号，姓名以及C成绩:"<<endl;
a.create();
a.disp();
} //主函数