简单通讯录
contact.h
#pragma once#define MAX 100 //通讯录存储的人数
#define NAME_MAX 20 //联系人的名字长度
#define SEX_MAX 5 //性别的长度
#define ADDR_MAX 30 //地址的长度
#define TELE_MAX 12 //电话的长度#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <stdlib.h>typedef struct PeoInfo
{char name[NAME_MAX]; //名字int age; //年龄char sex[SEX_MAX]; //性别char addr[ADDR_MAX]; //地址char tele[TELE_MAX]; //电话
} PeoInfo;typedef struct Contact
{PeoInfo data[MAX]; //通讯录 数组int sz;//当前已存放的信息个数
} Contact;//初始化通讯录
void InitContact(Contact* pc);
//添加联系人
void AddContact(Contact* pc);
//删除联系人
void DelContact(Contact* pc);
//查找联系人
void SearchContact(const Contact* pc);
//修改联系人
void ModifyContact(Contact* pc);
//排序通讯录
void QsortContact(Contact* pc);
//清空通讯录
void ClearContact(Contact* pc);
//展示通讯录
void ShowContact(const Contact* pc);
contact.c
#define _CRT_SECURE_NO_WARNINGS 1#include "contact.h"void InitContact(Contact* pc)
{assert(pc);pc->sz = 0;memset(pc->data, 0, sizeof(pc->data));
}void AddContact(Contact* pc)
{assert(pc);if (pc->sz == MAX){printf("通讯录已满,无法添加\n");return;}printf("请输入名字:>");scanf("%s", pc->data[pc->sz].name);printf("请输入年龄:>");scanf("%d", &(pc->data[pc->sz].age));printf("请输入性别:>");scanf("%s", pc->data[pc->sz].sex);printf("请输入地址:>");scanf("%s", pc->data[pc->sz].addr);printf("请输入电话:>");scanf("%s", pc->data[pc->sz].tele);pc->sz++;
}//用名字来查找联系人
int FindByName(const Contact* pc, char name[])
{int i = 0;for (i = 0; i < pc->sz; i++){if (strcmp(pc->data[i].name, name) == 0){return i;}}return -1;
}void DelContact(Contact* pc)
{assert(pc);if (pc->sz == 0){printf("通讯录为空,无法删除\n");return;}char name[NAME_MAX];printf("请输入要删除的人的名字:>");scanf("%s", name);int ret = FindByName(pc, name);if (ret == -1){printf("要删除的人不存在\n");return;}int i = 0;for (i = ret; i < pc->sz - 1; i++){pc->data[i] = pc->data[i + 1];}pc->sz--;printf("删除成功\n");
}void SearchContact(const Contact* pc)
{assert(pc);char name[NAME_MAX] = { 0 };printf("请输入要查找人的名字:>");scanf("%s", name);int pos = FindByName(pc, name);if (pos == -1){printf("要查找的人不存在\n");return;}printf("%-20s\t%-4s\t%-5s\t%-20s\t%-12s\n", "名字", "年龄", "性别", "地址", "电话");printf("%-20s\t%-4d\t%-5s\t%-20s\t%-12s\n", pc->data[pos].name,pc->data[pos].age,pc->data[pos].sex,pc->data[pos].addr,pc->data[pos].tele);
}void ModifyContact(Contact* pc)
{assert(pc);char name[NAME_MAX] = { 0 };printf("请输入要修改人的名字:>");scanf("%s", name);int pos = FindByName(pc, name);if (pos == -1){printf("要修改的人不存在\n");return;}printf("请输入名字:>");scanf("%s", pc->data[pos].name);printf("请输入年龄:>");scanf("%d", &(pc->data[pos].age));printf("请输入性别:>");scanf("%s", pc->data[pos].sex);printf("请输入地址:>");scanf("%s", pc->data[pos].addr);printf("请输入电话:>");scanf("%s", pc->data[pos].tele);printf("修改完成\n");
}//qsort中使用的比较函数
int ComparByName(const char* p1, const char* p2)
{return strcmp(p1, p2);
}
void QsortContact(Contact* pc)
{assert(pc);qsort(pc->data, pc->sz, sizeof(PeoInfo), ComparByName);printf("排序完成\n");
}void ClearContact(Contact* pc)
{assert("pc");InitContact(pc);printf("通讯录已清空\n");
}void ShowContact(const Contact* pc)
{assert(pc);int i = 0;printf("%-20s\t%-4s\t%-5s\t%-20s\t%-12s\n", "名字", "年龄", "性别", "地址", "电话");for (i = 0; i < pc->sz; i++){printf("%-20s\t%-4d\t%-5s\t%-20s\t%-12s\n", pc->data[i].name,pc->data[i].age,pc->data[i].sex,pc->data[i].addr,pc->data[i].tele);}
}
test.c
#define _CRT_SECURE_NO_WARNINGS 1#include "contact.h"void menu()
{printf("************************************\n");printf("****** 1. add 2. del ******\n");printf("****** 3. search 4. modify ******\n");printf("****** 5. show 6. sort ******\n");printf("****** 7. clear 0. exit ******\n");printf("************************************\n");
}
//枚举操作,增加代码可读性
enum Option
{EXIT,ADD,DEL,SEARCH,MODIFY,SHOW,SORT,CLEAR
};
int main()
{int input = 0;Contact con;InitContact(&con);do{menu();printf("请输入:>");scanf("%d", &input);switch (input){//增加代码可读性case ADD:AddContact(&con);break;case DEL:DelContact(&con);break;case SEARCH:SearchContact(&con);break;case MODIFY:ModifyContact(&con);break;case SHOW:ShowContact(&con);break;case SORT:QsortContact(&con);break;case CLEAR:ClearContact(&con);break;case EXIT:printf("退出通讯录\n"); break;default:printf("选择错误,重新选择\n");break;}} while (input);return 0;
}
