通讯薄.doc

通讯薄王朋勇 200901050320 #include<iostream> #include<iomanip> using namespace std; #define N 20000 class people { public: char name[20]; int number; int telephone; int qq; char address[10]; people *next; public: people *create(int);// 返回值类型是 people people *deletepeople(people *head,int); people *insert(people *head,people *stud); people *search(people *head,int); people *reverse(people *head,int); people *modify(people *head,int); void print(people *head); }; people *people::create(int n)/* 创建信息*/ { people *p1,*p2,*head=NULL; for(int i=1;i<=n;i++) { p1=( people *) malloc(sizeof(people ));/* 开辟新结点*/ cout<<" 输入第"<<i<<" 个学生--- 姓名· 学号· 电话· QQ · 住址\n"; cout<<" 姓名:"<<setw(2); cin>>p1->name; cout<<" 学号:"; cin>>p1->number; cout<<" 电话:"; cin>>p1->telephone; cout<<"QQ:"; cin>>p1->qq; cout<<" 住址:"; cin>>p1->address; p1->next=NULL;/* 新结点至空*/ if(i==1) head=p1; else p2->next=p1; p2=p1;/* 建立链表*/ } return(head); } people *people::search(people *head,int number)/* 查找信息*/ { people *p1,*p2; p1=head; while(p1->number != number && p1->next != NULL)/* 移动指针,按学号查找结点*/ { p2=p1; p1=p1->next; } if(p1->number == number)/* 找到信息*/ { cout<<" 学号为"<<number<<" 的学生信息存在:\n"; cout<<" 姓名:"<<p1->name<<" 学号:"<<p1->number<<" 电话:"<<p1->telephone<<" QQ:"<<p1->qq<<" 住址:"<<p1->address<<endl; } else cout<<" 学号为"<<number<<" 的学生信息不存在:"; return(head); } people *people::deletepeople(people *head,int number)/* 删除信息*/ { people *p1,*p