1、简易学生信息库(结构体)
# include<iostream>
# include<iomanip>
using namespace std;
struct Student
{
int num;
float score;
struct Student *next;//指向自己类型
};// ;容易掉
int main()
{
struct Student a, b, c, *head, *p;//定义一个头指针和一个移动指针
a.num = 1;
a.score = 90;
b.num = 2;
b.score = 80;
c.num = 3;
c.score = 70;
head = &c;
// a.next = &b;
// b.next = &c;
c.next = NULL;//最后一个学生指向空
p = head;
while(p!=NULL)//等价于while(p)
{
cout<<p->num<<" "<<fixed<<setprecision(1)<<p->score<<endl;
//printf("%ld%5.1f\n",p->num,p->score);//C
p=p->next;
}
return 0;
}
2、简易学生信息库(类)
//简易学生信息库(类)
# include<iostream>
using namespace std;
# define MAX 10000
class student{
private:
int num;
char name[10];
char sex;
float Math;
float Chinese;
float English;
public:
void input();
void sum();
void aval();
};//;容易掉
void student::input(){
cout<<"请输入学生学号:";
cin>>num;
cout<<"请输入学生姓名:";
cin>>name;
cout<<"请输入学生性别:";
cin>>sex;
cout<<"请输入数学成绩:";
cin>>Math;
cout<<"请输入语文成绩:";
cin>>Chinese;
cout<<"请输英语学成绩:";
cin>>English;
}
void student::sum(){
float S = Math+ Chinese+ English;
cout<<S<<endl;
}
void student::aval(){
float S = Math+ Chinese+ English;
cout<<S/3<<endl;
}
int main()
{
student liuyihan[MAX];
for(int i = 1; i < MAX; i++)
{
cout<<"请输入第"<<i<<"位学生的信息: "<<endl;
liuyihan[i].input();
cout<<endl;
cout<<"该学生的总分是: ";
liuyihan[i].sum();
cout<<endl;
cout<<"该学生的平均分是: ";
liuyihan[i].aval();
cout<<endl;
}
return 0;
}
3、简易职工信息库(类)
# include<iostream>
using namespace std;
class Employee{
private:
char name[10];
char sex;
int num;//工龄
float gongzi;
float jingtie;
float xiaoyi;
public:
void input();
void sum1();
void sum2();
void sum3();
};
void Employee::input(){
cout<<"请输入你的名字:" <<endl;
cin>>name;
cout<<"请输入你的性别:" <<endl;
cin>>sex;
cout<<"请输入你的工号:" <<endl;
cin>>num;
cout<<"请输入你的基础工资:" <<endl;
cin>>gongzi;
cout<<"请输入你的岗位津贴:" <<endl;
cin>>jingtie;
cout<<"请输入你的效应工资:" <<endl;
cin>>xiaoyi;
}
void Employee::sum1(){
cout<<endl;
cout<<"应付工资:"<<endl;
float a = gongzi +jingtie + xiaoyi;
cout<<a<<endl;
}
void Employee::sum2(){
cout<<endl;
cout<<"个人所得税:"<<endl;
float a = gongzi +jingtie + xiaoyi;
if(a <= 3500)
cout<<0<<endl;
else
cout<<(a - 3500)*0.03<<endl;
}
void Employee::sum3(){
float b;
cout<<endl;
cout<<"实发工资:"<<endl;
float a = gongzi +jingtie + xiaoyi;
if(a <= 3500)
b = 0;
else
b = (a - 3500)*0.03;
cout<<b<<endl;
}
int main()
{
Employee liuyihan;
liuyihan.input();
liuyihan.sum1();
liuyihan.sum2();
liuyihan.sum3();
return 0;
}
4、链表的创建和输出(优化)
#include<iostream>
#include<string>
#include<iomanip>
#include<fstream>
using namespace std;
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status; //Status 是函数返回值类型,其值是函数结果状态代码。
typedef int ElemType; //ElemType 为可定义的数据类型,此设为int类型
typedef struct LNode {
ElemType data; //结点的数据域
struct LNode *next; //结点的指针域
} LNode, *LinkList; //LinkList为指向结构体LNode的指针类型
Status InitList(LinkList &L) { //算法2.6 单链表的初始化
//构造一个空的单链表L
L = new LNode; //生成新结点作为头结点,用头指针L指向头结点
L->next = NULL; //头结点的指针域置空
return OK;
}
Status GetElem(LinkList L, int i, ElemType &e) { //算法2.7 单链表的取值
//在带头结点的单链表L中查找第i个元素
//用e返回L中第i个数据元素的值
int j;
LinkList p;
p = L->next;
j = 1; //初始化,p指向第一个结点,j为计数器
while (j < i && p) { //顺链域向后扫描,直到p指向第i个元素或p为空
p = p->next; //p指向下一个结点
++j; //计数器j相应加1
}
if (!p || j > i)
return ERROR; //i值不合法i>n或i<=0
e = p->data; //取第i个结点的数据域
return OK;
} //GetElem
LNode *LocateElem(LinkList L, ElemType e) { //算法2.8 按值查找
//在带头结点的单链表L中查找值为e的元素
LinkList p;
p = L->next;
while (p && p->data != e)//顺链域向后扫描,直到p为空或p所指结点的数据域等于e
p = p->next; //p指向下一个结点
return p; //查找成功返回值为e的结点地址p,查找失败p为NULL
} //LocateElem
Status ListInsert(LinkList &L, int i, ElemType e) { //算法2.9 单链表的插入
//在带头结点的单链表L中第i个位置插入值为e的新结点
int j;
LinkList p, s;
p = L;
j = 0;
while (p && j < i - 1) {
p = p->next;
++j;
}//查找第i?1个结点,p指向该结点
if (!p || j > i - 1)
return ERROR; //i>n+1或者i<1
s = new LNode; //生成新结点*s
s->data = e; //将结点*s的数据域置为e
s->next = p->next; //将结点*s的指针域指向结点ai
p->next = s; //将结点*p的指针域指向结点*s
return OK;
} //ListInsert
Status ListDelete(LinkList &L, int i) { //算法2.9 单链表的删除
//在带头结点的单链表L中,删除第i个位置
LinkList p, q;
int j;
p = L;
j = 0;
while ((p->next) && (j < i - 1)) //查找第i?1个结点,p指向该结点
{
p = p->next;
++j;
}
if (!(p->next) || (j > i - 1))
return ERROR; //当i>n或i<1时,删除位置不合理
q = p->next; //临时保存被删结点的地址以备释放
p->next = q->next; //改变删除结点前驱结点的指针域
delete q; //释放删除结点的空间
return OK;
} //ListDelete
void CreateList_H(LinkList &L, int n) { //算法2.11 前插法创建单链表
//逆位序输入n个元素的值,建立到头结点的单链表L
LinkList p;
int i;
L = new LNode;
L->next = NULL; //先建立一个带头结点的空链表
for(i=0;i<n;i++)
{
p = new LNode; //生成新结点*p
cin >> p->data; //输入元素值赋给新结点*p的数据域
p->next = L->next;
L->next = p; //将新结点*p插入到头结点之后
}
} //CreateList_H
void CreateList_R(LinkList &L, int n) { //算法2.12 后插法创建单链表
//正位序输入n个元素的值,建立带表头结点的单链表L
LinkList p, r;
int i;
L = new LNode;
L->next = NULL; //先建立一个带头结点的空链表
r = L; //尾指针r指向头结点
for(i=0;i<n;i++)
{
p = new LNode;//生成新结点
cin >> p->data ;//输入元素值赋给新结点*p的数据域
p->next = NULL;
r->next = p;//将新结点*p插入尾结点*r之后
r = p;//r指向新的尾结点*p
}
} //CreateList_R
void ShowList(LinkList L){
LinkList p;
p = L->next;
while(p)
{
cout<<p->data<<" ";
p = p->next;
}
cout<<endl;
}
int ListLength(LinkList L){//实现单链表的求表长操作
LinkList p;
p = L->next;
int i = 0;
while(p)
{
p = p->next;
i++;
}
return i;
}
int main(){
int a, e, i, j;
LinkList kk;
cout<<"******************************"<<endl;
cout<<"输入元素个数:";
int n;
cin>>n;
cout<<"输入元素:";
CreateList_R(kk, n);
cout<<"输出元素:"<<endl;
while(1)
{
ShowList(kk);
cout<<"******************************"<<endl;
cout<<"选项有:"<<endl;
cout<<"1:插入元素"<<endl;
cout<<"2:删除元素"<<endl;
cout<<"3:输出表长 "<<endl;
cout<<"******************************"<<endl;
cout<<"请输入您的选项:";
cin>>a;
switch(a)
{
case 1://插入元素
cout<<"插入元素e:";
cin>>e;
cout<<"元素e插入的位置:";
cin>>i;
ListInsert(kk, i, e);
cout<<"输出元素新链表:";
ShowList(kk);
cout<<endl;
break;
case 2://删除元素
cout<<"删除元素的位置j:";
cin>>j;
ListDelete(kk, j);
cout<<"输出元素新链表:";
ShowList(kk);
break;
case 3://输出表长
int length = ListLength(kk);
cout<<"表长为:"<<length<<endl;
break;
}
}
return 0;
}