
通讯录
Project1
#include
#include "test2.h"
void menu()
{
printf("*********************************************\n");
printf("************ 1. add 2. del ************\n");
printf("******** 3. search 4. modify ********\n");
printf("********** 5. show 6. sort **********\n");
printf("*********** 0. exit ***********\n");
printf("*********************************************\n");
}
int main()
{
int input = 0;
//创建通讯录
strcut Contact con;//con就是通讯录,里边包含:1000的元素数和size
//还需要知道最多能放多少人,其实就是MAX
//初始化通讯录
InitContact(&con);
do
{
menu();
printf("请选择:>");
scanf("%d", &input);
switch (input)
{
case ADD:
AddContact(&con);
break;
case DEL:
DeleContact(&con);
break;
case SEARCH:
SearchContact(&con);
break;
case MODIFY:
ModifyContact(&con);
break;
case SHOW:
ShowContact(&con);
break;
case SORT:
SortContact(&con);
break;
case EXIT :
printf("退出通讯录\n");
break;
default:
printf("选择错误\n");
break;
}
} while ();
return 0;
}
test1.c
#include "test2.h"
void InitContact(struct Contact* ps)
{
memset(ps->data, 0, sizeof(ps->data));
ps->size = 0;
}
void AddContact(struct Contact* ps)
{
if (ps->size == MAX)
{
printf("通讯录已满,无法增加\n");
}
else
{
printf("请输入名字: >");
scanf("%s", px->data[ps->size].name);//指向通讯录的data的下标为sizeof处
printf("请输入年龄: >");
scanf("%s", &(px->data[ps->size].age));
printf("请输入性别: >");
scanf("%s", px->data[ps->size].sex);
printf("请输入电话: >");
scanf("%s", px->data[ps->size].tele);
printf("请输入地址: >");
scanf("%s", px->data[ps->size].addr);
ps->size++;
printf("添加成功\n");
}
}
void ShowContact(const struct Contact* ps)
{
if (ps->size == 0)
{
printf("通讯录为空\n");
}
else
{
int i = 0;
printf("%-20s\t %-4s\t %-5s\t %-12s\t %-20s\n", "名字", "年龄", "性别", "电话", "地址");
for (i = 0; i < ps->size; i++)
{
printf("%-20s\t %-4d\t %-5s\t %-12s\t %-20s\n",
ps->data[i].name,
ps->data[i].age,
ps->data[i].sex,
ps->data[i].tele,
ps->data[i].addr);
}
}
}
static int FindByName(const struct Contact* ps, char name[MAX_NAME])
{
int i = 0;
for (i = 0; i < ps->size; i++)
{
if (0 == strcmp(ps->data[i].name, name))
{
return i;
}
}
return -1;
}
void DelContact(struct Contact* ps)
{
char name[MAX_NAME];
printf("请输入要删除的姓名:>");
scanf("%s", name);
//一个函数用来查找,查找要删除的人在什么位置
//找到返回名字所在元素的下标
//找不到返回-1
int pos = FindByName(ps,name);
if (pos == -1)
{
printf("要删除的人不存在\n");
}
else
{
int j = 0;
for (j = pos; j < ps->size - 1; j++)
{
ps->data[j] = ps->data[j + 1]
}
ps->size--;
printf("删除成功\n");
}
}
void SearchContact(const struct Contact* ps)
{
char name[MAX_NAME];
printf("请输入要查找人的名字:>");
scanf("%s", name);
int pos = FindByName(ps, name);
if (pos == -1)
{
printf("要查找的人不存在\n");
}
else
{
printf("%-20s\t %-4s\t %-5s\t %-12s\t %-20s\n", "名字", "年龄", "性别", "电话", "地址");
printf("%-20s\t %-4d\t %-5s\t %-12s\t %-20s\n",
ps->data[i].name,
ps->data[i].age,
ps->data[i].sex,
ps->data[i].tele,
ps->data[i].addr);
}
}
void ModifyContact(struct Contact* ps)
{
char name[MAX_NAME];
printf("请输入要修改人的名字:>");
scanf("%s", name);
int pos = FindByName(ps, name);
if (pos == -1)
{
printf("要修改的人不存在\n");
}
else
{
printf("请输入名字: >");
scanf("%s", px->data[ps->size].name);
printf("请输入年龄: >");
scanf("%s", &(px->data[ps->size].age));
printf("请输入性别: >");
scanf("%s", px->data[ps->size].sex);
printf("请输入电话: >");
scanf("%s", px->data[ps->size].tele);
printf("请输入地址: >");
scanf("%s", px->data[ps->size].addr);
printf("修改成功\n");
}
}
void SortContact(struct Contact* ps)
{
int sz = sizeof(con) / sizeof(con[0]);
qsort(con, sz, sizeof(con[0]), cmp_Con_by_age);
}
int cmp_Con_by_age(const void* e1, const void* e2)
{
return ((struct Contact*)e1)->age - (struct Contact*)e2)->age;
}
test2.h
#include
#include
#define MAX 1000
#define MAX_NAME 20
#define MAX_SEX 5
#define MAX_SEX 12
#define MAX_ADDR 30
enum Option
{
EXIT,
ADD,
DEL,
SEARCH,
MODIFY,
SHOW,
SORT
};
struct Peoinfo
{
char name[MAX NAME];
int age;
char sex[MAX_SEX];
char tele[MAX_SEX];
char addr[MAX_ADDR];
};
struct Contact
{
struct PeoInfo data[MAX];
int size;//记录当前通讯录有多少人的信息
};
void InitContact(struct Contact* ps);
void AddContact(struct Contact* ps);
void ShowContact(const struct Contact* ps);
void DelContact(struct Contact* ps);
void SearchContact(struct Contact* ps);
void ModifyContact(struct Contact* ps);
void SortContact(struct Contact* ps);
结束。
欢迎分享,转载请注明来源:内存溢出
微信扫一扫
支付宝扫一扫
评论列表(0条)