29.0、C语言——通讯录实例_实现代码
话不多说直接上代码 ->
test.c 文件如下所示->
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include "contact.h"
#include <stdlib.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;
//创建一个可存放3人的通讯录
struct Contact con;
//通讯录初始化
InitContact(&con);
do
{
menu();
printf("请选择:>\n");
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:
SortByName(&con);
break;
case EXIT:
distoryContact(&con);
printf("退出成功\n");
break;
default:
printf("输入有误,请重新输入~\n");
}
} while (input);
return 0;
}
头文件 contact.h 文件如下所示 ->
#pragma once
#include <stdlib.h>
#define DEFAULT_SZ 3;
#define MAX 3
#define MAX_NAME 20
#define MAX_SEX 5
#define MAX_TELE 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_TELE];
char addr[MAX_ADDR];
};
struct Contact {
struct PeoInfo* data;//存放一个联系人
int capacity;//记录当前通讯录的最大容量
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(const struct Contact* ps);
//修改联系人
void ModifyContact(struct Contact* ps);
//按照名字首拼音升序排序
void SortByName(struct Contact* ps);
//销毁通讯录
void distoryContact(struct Contact* ps);
contact.c 文件如下所示 ->
#define _CRT_SECURE_NO_WARNINGS 1
#include "contact.h"
#include <string.h>
#include <stdio.h>
//初始化通讯录
void InitContact(struct Contact* ps) {
int i = DEFAULT_SZ;
ps->data = (struct PeoInfo*)malloc(i * sizeof(struct PeoInfo));
if (ps->data == NULL) {
return;
}
memset(ps->data, 0, sizeof(ps->data));
ps->size = 0;
ps->capacity = DEFAULT_SZ;
}
//判断当前联系人是否溢出
void checkCapacity(struct Contact* ps) {
if (ps->capacity == ps->size) {
//增容
struct PeoInfo* ptr = (struct PeoInfo*)realloc(ps->data, (ps->capacity + 2) * sizeof(struct PeoInfo));
if (ptr != NULL) {
printf("增容成功\n");
ps->data = ptr;
ps->capacity += 2;
}
else {
printf("增容失败\n");
}
}
}
//添加联系人
void AddContact(struct Contact* ps) {
checkCapacity(ps);
printf("请输入名字\n");
scanf("%s",ps->data[ps->size].name);
printf("请输入年龄\n");
scanf("%d", &(ps->data[ps->size].age));
printf("请输入性别\n");
scanf("%s", ps->data[ps->size].sex);
printf("请输入电话\n");
scanf("%s", ps->data[ps->size].tele);
printf("请输入地址\n");
scanf("%s", ps->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;//找到了就返回i
}
}
//找不到的情况
return -1;
}
//删除联系人
void DelContact(struct Contact* ps) {
char name[MAX_NAME];
printf("请输入要删除人的名字\n");
scanf("%s",name);
//1.查找要删除人在什么位置,找不到就返回-1
int pos = FindByName(ps,name);
//2.删除
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("请输入要查找人的名字\n");
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[pos].name,
ps->data[pos].age,
ps->data[pos].sex,
ps->data[pos].tele,
ps->data[pos].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("请输入名字\n");
scanf("%s", ps->data[pos].name);
printf("请输入年龄\n");
scanf("%d", &(ps->data[pos].age));
printf("请输入性别\n");
scanf("%s", ps->data[pos].sex);
printf("请输入电话\n");
scanf("%s", ps->data[pos].tele);
printf("请输入地址\n");
scanf("%s", ps->data[pos].addr);
}
}
//按照名字首拼音升序排序
void SortByName(struct Contact* ps) {
int nums = ps->size;
int i = 0;
for (i = 0;i < nums - 1;i++) {
int j = 0;
for (j = 0;j < nums - i - 1;j++) {
if (1 == strcmp(ps->data[j].name, ps->data[j + 1].name)) {
struct PeoInfo temPeople = ps->data[j];
ps->data[j] = ps->data[j + 1];
ps->data[j + 1] = temPeople;
}
}
}
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);
}
}
//销毁通讯录
void distoryContact(struct Contact* ps) {
free(ps->data);
ps->data = NULL;
}
2061

被折叠的 条评论
为什么被折叠?



