你们要的通讯录完圣体来啦ฅ~(C语言)

我们之前实现的通讯录动态版本和静态版本都是在运行结束后销毁,所以最后创建了个球球嘛【扶额】。本次优化诞生了通讯录的最终版本:通讯录完圣体。通过使用文件保存操作,就可以把你的通讯录就可以保存在硬盘上啦~详情请阅读下文喔

更新公告

1.新增LoadContact函数,用以加载原来保存过的数据

2.增加SaveContact函数,用以在文件中保存本次新增的通讯录内容

窝萌来看一下代码的具体实现嘞:

test.c

#define _CRT_SECURE_NO_WARNINGS 1
#include "contact.h"

void menu()
{
	printf("*****************************\n");
	printf("*****************************\n");
	printf("***  1.添加       2.删除  ***\n");
	printf("***  3.显示       4.修改  ***\n");
	printf("***  5.查找       0.退出  ***\n");
	printf("*****************************\n");
	printf("*****************************\n");

}
enum option
{
	EXIT,
	ADD,
	DELETE,
	SHOW,
	MODIFY,
	SEARCH
};
int main()
{
	int input = 0;
	struct Contact con;
	Initcontact(&con);
	do {
		menu();
		printf("请输入:");
		scanf("%d", &input);
		switch (input)
		{
		case ADD:
			Addcontact(&con);
			break;
		case DELETE:
			Delecontact(&con);
			break;
		case SHOW:
			Showcontact(&con);
			break;
		case MODIFY:
			Modicontact(&con);
			break;
		case SEARCH:
			Searcontact(&con);
			break;
		case EXIT:
			SaveContact(&con);
			DestoryContact(&con);
			break;
		default:
			printf("输入错误,请重新输入\n");
			break;
		}
	} while (input);
	return 0;
}

contact.c

#define _CRT_SECURE_NO_WARNINGS 1
#include "contact.h"
#define MAX 1000
#define DEFAULT_SZ 3

void Initcontact(struct Contact* pc)
{
	pc->sz = 0;
	pc->data=(struct PeoInfo*)malloc(DEFAULT_SZ*sizeof(struct PeoInfo));
	pc->capacity = DEFAULT_SZ;
	LoadContact(pc);
}
void CheckCapacity(struct Contact* pc)
{
	if (pc->sz == pc->capacity)
	{
		struct PeoInfo* ptr = (struct PeoInfo*)realloc(pc->data, (pc->capacity + 2) * sizeof(struct PeoInfo));
		if (ptr != NULL)
		{
			pc->data = ptr;
			pc->capacity += 2;
			printf("增容成功!\n");
		}
		else
		{
			printf("通讯录增容失败\n");
			exit(1);
		}
	}
}
void LoadContact(struct Contact* pc)
{
	FILE* pf = fopen("data.txt", "rb");
	if (NULL == pf)
	{
		perror("LoadContact::fopen");
		return;
	}
	struct PeoInfo tmp = { 0 };
	while (fread(&tmp, sizeof(struct PeoInfo), 1, pf))
	{
		CheckCapacity(pc);
		pc->data[pc->sz] = tmp;
		pc->sz++;
	}
	fclose(pf);
	pf = NULL;
}
void Addcontact(struct Contact* pc)
{
	CheckCapacity(pc);
	if (pc->sz == pc->capacity)
	{
		struct PeoInfo* ptr = (struct PeoInfo*)realloc(pc->data, (pc->capacity + 2) * sizeof(struct PeoInfo));
		if (ptr != NULL)
		{
			pc->data = ptr;
			pc->capacity += 2;

			printf("增容成功\n");
		}
		else
		{
			return;
		}
	}
	else
	{
		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].tele);
		printf("请输入地址:");
		scanf("%s", pc->data[pc->sz].addr);
	}
	pc->sz++;
	printf("添加成功\n");
	printf("\n");
}
void Showcontact(struct Contact* pc)
{
	printf("%-15s\t%-5s\t%-5s\t%-15s\t%-20s\n", "姓名", "年龄", "性别", "电话号码", "地址");
	int i = 0;
	for (i = 0; i < pc->sz; i++)
	{
		printf("%-15s\t%-5d\t%-5s\t%-15s\t%-20s\n",
			pc->data[i].name,
			pc->data[i].age,
			pc->data[i].sex,
			pc->data[i].tele,
			pc->data[i].addr);
	}
	printf("\n");

}
void DestroyContact(struct Contact* pc)
{
	free(pc->data);
	pc->data = NULL;
	pc->capacity = 0;
	pc->sz = 0;
}
int Throucontact(const struct 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 Delecontact(struct Contact* pc)
{
	printf("请输入要删除联系人的姓名:");
	char name[NAME_MAX] = { 0 };
	scanf("%s", name);
	int ret = Throucontact(pc, name);
	if (0 == pc->sz)
	{
		printf("当前无联系人,无法删除\n");
	}
	else if (ret == -1)
	{
		printf("通讯录中无此联系人\n");
	}
	else
	{
		int i = 0;
		for (i = ret; i < pc->sz - 1; i++)
		{
			pc->data[i] = pc->data[i + 1];
		}
		pc->sz--;
		printf("删除成功\n");
		printf("\n");
	}
}
void Searcontact(struct Contact* pc)
{
	printf("请输入要查找联系人的姓名:");
	char name[NAME_MAX] = { 0 };
	scanf("%s", name);
	int ret = Throucontact(pc, name);
	if (ret == -1)
	{
		printf("通讯录中无此联系人\n");
	}
	else
	{
		printf("%-15s\t%-5s\t%-5s\t%-15s\t%-20s\n", "姓名", "年龄", "性别", "电话号码", "地址");
		printf("%-15s\t%-5d\t%-5s\t%-15s\t%-20s\n",
			pc->data[ret].name,
			pc->data[ret].age,
			pc->data[ret].sex,
			pc->data[ret].tele,
			pc->data[ret].addr);
	}
	printf("\n");
}
void Modicontact(struct Contact* pc)
{
	printf("请输入要修改联系人的姓名:");
	char name[NAME_MAX] = { 0 };
	scanf("%s", name);
	int ret = Throucontact(pc, name);
	if (ret == -1)
	{
		printf("通讯录中无此联系人\n");
	}
	else
	{
		printf("请输入修改后的姓名:");
		scanf("%s", pc->data[ret].name);
		printf("请输入修改后的年龄:");
		scanf("%d", &(pc->data[ret].age));
		printf("请输入修改后的性别:");
		scanf("%s", pc->data[ret].sex);
		printf("请输入修改后的电话号码:");
		scanf("%s", pc->data[ret].tele);
		printf("请输入修改后的地址:");
		scanf("%s", pc->data[ret].addr);
	}
	printf("修改成功\n");
	printf("\n");
}
void SaveContact(struct Contact* pc)
{
	FILE* pf = fopen("data.txt", "wb");
	if (NULL == pf)
	{
		perror("SaveContact::fopen");
		return ;
	}
	else
	{
		int i = 0;
		for (i = 0; i < pc->sz; i++)
		{
			fwrite(pc->data + i, sizeof(struct PeoInfo), 1, pf);
		}
	}
	fclose(pf);
	pf = NULL;
}

contact.h

#pragma once
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAX 1000
#define NAME_MAX 20
#define SEX_MAX 5
#define TELE_MAX 15
#define ADDR_MAX 30

struct PeoInfo
{
	char name[NAME_MAX];
	int age;
	char sex[SEX_MAX];
	char tele[TELE_MAX];
	char addr[ADDR_MAX];
};
struct Contact
{
	struct PeoInfo* data;
	int sz;
	int capacity;
};

void Initcontact(struct Contact* pc);
void Addcontact(struct Contact* pc);
void Showcontact(struct Contact* pc);
void Delecontact(struct Contact* pc);
void Searcontact(struct Contact* pc);
void Modicontact(struct Contact* pc);
void SaveContact(struct PeoInfo* pc);
void LoadContact(struct Contact* pc);
void CheckCapacity(struct Contact* pc);
void DestoryContact(struct Contact* pc);

各位客官觉得不错的话请三连支持一下喔~喜上加喜那可是再好不过啦QwQ

  • 2
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 4
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 4
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

喜欢喝雪碧的阿埋

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值