1.初始化
显示菜单界面
void show()
{
cout << "****** 1.添加联系人 ******" << endl;
cout << "****** 2.显示联系人 ******" << endl;
cout << "****** 3.删除联系人 ******" << endl;
cout << "****** 4.查找联系人 ******" << endl;
cout << "****** 5.修改联系人 ******" << endl;
cout << "****** 6.清空联系人 ******" << endl;
cout << "****** 0.退出 ******" << endl;
}
设计联系人结构体
//设计联系人结构体
struct person
{
string name;
int sex=0; //男1 女2
int age=0;
string phone;
string addr;
};
通讯录结构体
#define max 100
//通讯录结构体
struct books
{
struct person arr[max];
int size=0; //联系人个数
};
2.添加联系人
void addperson(books* abs)
{
if (abs->size <= max)
{
string name;
cout << "请输入姓名: " << endl; cin >> name;
abs->arr[abs->size].name = name;
cout << "请输入性别 男1 女2" << endl;
while (1)
{
int sex = 0; cin >> sex;
if (sex == 0 || sex == 1)
{
abs->arr[abs->size].sex = sex;
break;
}
else
cout << "输入有误,请重新输入" << endl;
}
cout << "请输入年龄" << endl;
int age = 0; cin >> age;
abs->arr[abs->size].age = age;
cout << "请输入电话" << endl;
string phone; cin >> phone;
abs->arr[abs->size].phone = phone;
cout << "请输入家庭住址" << endl;
string address; cin >> address;
abs->arr[abs->size].addr = address;
abs->size += 1;
cout << "您已经添加成功!" << endl;
system("pause");
}
else
{
cout << "通讯录已经满了,添加失败" << endl;
return;
}
}
3.显示联系人
//显示联系人
void showperson(books* abs)
{
if (abs->size == 0)
cout << "当前记录为空" << endl;
else
{
for (int i = 0; i < abs->size; i++)
{
cout << "姓名是:" << abs->arr[i].name << endl;
cout << "性别是:" << (abs->arr[i].sex==1 ? "男":"女") << endl;
cout << "年龄是:" << abs->arr[i].age << endl;
cout << "电话是:" << abs->arr[i].phone << endl;
cout << "住址是:" << abs->arr[i].addr << endl;
}
}
system("pause");
}
4.判断联系人是否存在
int exist(books* abs, string name)
{
for (int i = 0; i < abs->size; i++)
{
if (abs->arr[i].name == name)
return i;
}
return -1;
}
5.删除联系人
void deletee(books* abs,string name)
{
int ret = exist(abs, name);
for (int i = ret; i < abs->size; i++)
{
abs->arr[i] = abs->arr[i + 1];
}
abs->size--;
cout << "删除成功" << endl;
}
6.查找联系人
其中 system("cls"); 表示清空之前输出的所有数据
void find(books* abs, string name)
{
int ret = exist(abs, name);
if (ret == -1)
{
cout << "查无此人" << endl;
return;
}
else
{
cout << "姓名是:" << abs->arr[ret].name << endl;
cout << "性别是:" << (abs->arr[ret].sex == 1 ? "男" : "女") << endl;
cout << "年龄是:" << abs->arr[ret].age << endl;
cout << "电话是:" << abs->arr[ret].phone << endl;
cout << "住址是:" << abs->arr[ret].addr << endl;
}
system("cls");
}
7.修改联系人
void modify(books* abs, string name)
{
int ret = exist(abs, name);
if (ret == -1)
{
cout << "查无此人" << endl;
return;
}
else //只做名字的修改
{
string name; cout << "请重新输入要修改成的姓名" << endl;
cin >> name;
abs->arr[ret].name = name;
cout << "修改成功!";
}
}
8.删除通讯录
我们不一定要一个个删除数据,我们只需要将记录中的联系人个数等于0即可
void clean(books* abs)
{
abs->size = 0; //将当前记录的联系人记录为0
cout << "通讯录清空成功" << endl;
system("pause");
}
完整代码如下
#include <iostream>
#include <string>
#define max 100
using namespace std;
//设计联系人结构体
struct person
{
string name;
int sex=0; //男1 女2
int age=0;
string phone;
string addr;
};
//通讯录结构体
struct books
{
struct person arr[max];
int size=0; //联系人个数
};
void addperson(books* abs)
{
if (abs->size <= max)
{
string name;
cout << "请输入姓名: " << endl; cin >> name;
abs->arr[abs->size].name = name;
cout << "请输入性别 男1 女2" << endl;
while (1)
{
int sex = 0; cin >> sex;
if (sex == 0 || sex == 1)
{
abs->arr[abs->size].sex = sex;
break;
}
else
cout << "输入有误,请重新输入" << endl;
}
cout << "请输入年龄" << endl;
int age = 0; cin >> age;
abs->arr[abs->size].age = age;
cout << "请输入电话" << endl;
string phone; cin >> phone;
abs->arr[abs->size].phone = phone;
cout << "请输入家庭住址" << endl;
string address; cin >> address;
abs->arr[abs->size].addr = address;
abs->size += 1;
cout << "您已经添加成功!" << endl;
system("pause");
}
else
{
cout << "通讯录已经满了,添加失败" << endl;
return;
}
}
//显示联系人
void showperson(books* abs)
{
if (abs->size == 0)
cout << "当前记录为空" << endl;
else
{
for (int i = 0; i < abs->size; i++)
{
cout << "姓名是:" << abs->arr[i].name << endl;
cout << "性别是:" << (abs->arr[i].sex==1 ? "男":"女") << endl;
cout << "年龄是:" << abs->arr[i].age << endl;
cout << "电话是:" << abs->arr[i].phone << endl;
cout << "住址是:" << abs->arr[i].addr << endl;
}
}
system("pause");
}
//显示菜单界面
void show()
{
cout << "****** 1.添加联系人 ******" << endl;
cout << "****** 2.显示联系人 ******" << endl;
cout << "****** 3.删除联系人 ******" << endl;
cout << "****** 4.查找联系人 ******" << endl;
cout << "****** 5.修改联系人 ******" << endl;
cout << "****** 6.清空联系人 ******" << endl;
cout << "****** 0.退出 ******" << endl;
}
int exist(books* abs, string name)
{
for (int i = 0; i < abs->size; i++)
{
if (abs->arr[i].name == name)
return i;
}
return -1;
}
void deletee(books* abs,string name)
{
int ret = exist(abs, name);
for (int i = ret; i < abs->size; i++)
{
abs->arr[i] = abs->arr[i + 1];
}
abs->size--;
cout << "删除成功" << endl;
}
void find(books* abs, string name)
{
int ret = exist(abs, name);
if (ret == -1)
{
cout << "查无此人" << endl;
return;
}
else
{
cout << "姓名是:" << abs->arr[ret].name << endl;
cout << "性别是:" << (abs->arr[ret].sex == 1 ? "男" : "女") << endl;
cout << "年龄是:" << abs->arr[ret].age << endl;
cout << "电话是:" << abs->arr[ret].phone << endl;
cout << "住址是:" << abs->arr[ret].addr << endl;
}
system("cls");
}
void modify(books* abs, string name)
{
int ret = exist(abs, name);
if (ret == -1)
{
cout << "查无此人" << endl;
return;
}
else //只做名字的修改
{
string name; cout << "请重新输入要修改成的姓名" << endl;
cin >> name;
abs->arr[ret].name = name;
cout << "修改成功!";
}
}
void clean(books* abs)
{
abs->size = 0; //将当前记录的联系人记录为0
cout << "通讯录清空成功" << endl;
system("pause");
}
int main()
{
//创建通讯录结构体变量
books abs;
//当前人员个数
abs.size = 0;
while (1)
{
show();
cout << "请输入选项 " << endl;
int select = 0;
cin >> select;
switch (select)
{
case 1: //1.添加联系人
addperson(&abs);
break;
case 2: //2.显示联系人
showperson(&abs);
break;
case 3: //3.删除联系人
{
cout << "请输入删除人联系姓名" << endl;
string m_name; cin >> m_name;
if (exist(&abs, m_name) == -1)
cout << "查无此人" << endl;
else
deletee(&abs, m_name);
}
break;
case 4:
//4.查找联系人
{
cout << "请输入查找的联系人";
string name; cin >> name;
find(&abs, name);
}
break;
case 5: //5.修改联系人
{
cout << "请输入查找的联系人";
string name; cin >> name;
modify(&abs, name);
}
break;
case 6: //6.清空联系人
clean(&abs);
break;
case 0:
cout << "欢迎下次使用" << endl;
return 0;
break;
default:
break;
}
}
return 0;
}