动态通讯录的实现

contact.h

#ifndef CONTACT_H    
#define CONTACT_H    
enum Option
{
	EXIT,
	ADD,
	DEL,
	SEARCH,
	MODIFY,
	SHOW,
	SORT,
	EMPTY
};
#include<stdio.h>  
#include<windows.h>  
#include<stdlib.h>  
#include<errno.h>

#define NAME_MAX 20  
#define SEX_MAX  5  
#define AGE_MAX  3  
#define TEL_MAX 20  
#define ADDR_MAX 30  
#define MAX 1000  
#define DEFAULT_SZ 3
typedef struct PeoInfo
{
	char name[NAME_MAX];
	char sex[SEX_MAX];
	char age[AGE_MAX];
	char tel[TEL_MAX];
	char addr[ADDR_MAX];
}PeoInfo,*pPeoInfo;
typedef struct Contact
{
	pPeoInfo data;//数据存放的位置
	int sz;//有效元素的个数
	int capacity;//容量
}Contact, *pContact;
void InitContact(pContact pc);//初始化通讯录  
void DestroyContact(pContact pc);
void AddContact(pContact pc);//增添函数  
void ShowContact(pContact pc); //展示函数  
void DelContact(pContact pc);//删除函数  
int SearchContact(pContact pc);//查找函数  
int ModifyContact(pContact pc);//修改函数  
void SortContact(pContact pc);//排序函数  
int EmptyContact(pContact pc);//清空函数  
#endif 

contact.c

#define _CRT_SECURE_NO_WARNINGS 1  
#include"contact.h"  
void InitContact(pContact pc)
{
	pc->sz = 0;
	pc->capacity = DEFAULT_SZ;
	pc->data = (pPeoInfo)calloc(pc->capacity,sizeof(PeoInfo));
	if (pc->data == NULL)
	{
		printf("%s\n", strerror(errno));
		exit(EXIT_FAILURE);
	}
}
void DestroyContact(pContact pc)
{
	free(pc->data);
	pc->data = NULL;
	pc->capacity = 0;
	pc->sz = 0;
}
void CheckCapacity(pContact pc)
{
	if (pc->capacity == pc->sz)
	{
		pPeoInfo ptr = realloc(pc->data, (pc->capacity += 2)*sizeof(PeoInfo));
		if (ptr != NULL)
		{
			pc->data = ptr;
		}
		printf("增容成功\n");
	}
}
void AddContact(pContact pc)
{
	CheckCapacity(pc);
	printf("请输入名字:");
	scanf("%s", pc->data[pc->sz].name);
	printf("请输入性别:");
	scanf("%s", pc->data[pc->sz].sex);
	printf("请输入年龄:");
	scanf("%d", pc->data[pc->sz].age);
	printf("请输入电话:");
	scanf("%s", pc->data[pc->sz].tel);
	printf("请输入地址:");
	scanf("%s", pc->data[pc->sz].addr);
	pc->sz++;
	printf("添加成功\n");
}
void ShowContact(pContact pc)
{
	unsigned int i = 0;
	printf("%-10s\t %-5s\t %-5s %-10s %-10s\n", "name", "sex", "age", "tel", "addr");
	for (i = 0; i < pc->sz; i++)
	{
		printf("%-10s\t %-5s\t %-5s %-10s %-10s\n", pc->data[i].name, pc->data[i].sex, pc->data[i].age, pc->data[i].tel, pc->data[i].addr);
	}
}
static int FindEntry(pContact pc, char name[])
{
	unsigned int i = 0;
	for (i = 0; i < pc->sz; i++)
	{
		if (strcmp(name, pc->data[i].name) == 0)
		{
			return i;
		};
		return -1;
	}
}
void DelContact(pContact pc)
{
	char name[NAME_MAX] = { 0 };
	int pos = 0;
	if (pc->sz == 0)
	{
		printf("没有信息可以删除\n");
		return;
	}
	printf("请输入要删除人的名字:>");
	scanf("%s", name);
	FindEntry(pc, name);
	if (pos == -1)
	{
		printf("删除的人不存在\n");
		return;
	}
	else
	{
		for (int i = 0; i < pc->sz - 1; i++)
		{
			pc->data[i] = pc->data[i + 1];
		}
		pc->sz--;
		printf("删除成功\n");
	}
}
int SearchContact(pContact pc)
{
	int ret = FindEntry(pc, pc->data);
	if (ret != -1)
	{
		printf("该联系人的信息为:\n");
		printf("姓名:%-5s\n", pc->data[ret].name, NAME_MAX);
		printf("性别:%-5s\n", pc->data[ret].sex, SEX_MAX);
		printf("年龄:%-5s\n", pc->data[ret].sex, SEX_MAX);
		printf("电话:%-5s\n", pc->data[ret].tel, TEL_MAX);
		printf("地址:%-5s\n", pc->data[ret].addr, ADDR_MAX);
		return 1;
	}
	else
	{
		printf("查不到该联系人\n");
		return -1;
	}
}
int ModifyContact(pContact pc)
{

	int ret = FindEntry(pc, pc->data);//定义ret 接收find_entry的返回位置    
	if (ret != -1)
	{
		printf("请重新编辑该联系人信息:\n");
		printf("请输入姓名:");
		scanf_s("%s", pc->data[ret].name, NAME_MAX);
		printf("请输入性别:");
		scanf_s("%s", pc->data[ret].sex, SEX_MAX);
		printf("请输入年龄:");
		scanf_s("%s", pc->data[ret].sex, SEX_MAX);
		printf("请输入电话:");
		scanf_s("%s", pc->data[ret].tel, TEL_MAX);
		printf("请输入地址:");
		scanf_s("%s", pc->data[ret].addr, ADDR_MAX);
		printf("修改成功!");
		return 1;
	}
	else
	{
		printf("找不到该联系人\n");
		return -1;
	}
}
void SortContact(pContact pc)
{
	int i = 0;
	int j = 0;
	for (i = 0; i < pc->sz - 1; i++)
	{
		for (j = 0; j < pc->sz - 1 - i; j++)
		{
			if (strcmp(pc->data[j].name, pc->data[j + 1].name)>0)
			{
				struct PeoInfo tmp = pc->data[j];
				pc->data[j] = pc->data[j + 1];
				pc->data[j + 1] = tmp;
			}
		}
	}
	printf("排序完成\n");
}
int EmptyContact(pContact pc)
{
	pc->sz = 0;//count 赋值0  进行清零    
	printf("清空成功!");
	return 1;
}

test.c

#define _CRT_SECURE_NO_WARNINGS 1  
#include"contact.h"  
void menu()
{
	printf("------------ 服务菜单 ---------------\n");
	printf("-------------------------------------\n");
	printf("           1.添加联系人\n");
	printf("           2.删除联系人\n");
	printf("           3.查找联系人\n");
	printf("           4.修改联系人\n");
	printf("           5.显示所有联系人\n");
	printf("           6.排序联系人\n");
	printf("           7.清空联系人\n");
	printf("           0.退出\n");
	printf("-------------------------------------\n");
}
int main()
{
	int input = 0;
	struct Contact my_con;
	InitContact(&my_con);
	do
	{
		menu();
		printf("请选择:>");
		scanf_s("%d", &input);
		switch (input)
		{
		case ADD:
			AddContact(&my_con);
			break;
		case DEL:
			DelContact(&my_con);
			break;
		case SEARCH:
			SearchContact(&my_con);
			break;
		case MODIFY:
			ModifyContact(&my_con);
			break;
		case SHOW:
			ShowContact(&my_con);
			break;
		case SORT:
			SortContact(&my_con);
			break;
		case EMPTY:
			EmptyContact(&my_con);
			break;
		case EXIT:
			DestroyContact(&my_con);
			break;
		default:
			printf("选择错误\n");
			break;
		}
	} while (input);
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值