使用数组简单实现通讯录

实现一个通讯录,可以保存联系人姓名、电话、年龄、性别、地址

头文件

#ifndef _CONTACT_H_
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<string.h>

#define MAX_NAME 10
#define MAX_TEL 11
#define MAX_ADDR 15
#define MAX_SEX 3
#define MAX_NUMPERSON 1000
#define MAX_STR 20
//个人信息
typedef struct Personlnfo
{
	char name[MAX_NAME];
	short age;
	char tele[MAX_TEL];
	char addr[MAX_ADDR];
	char sex[MAX_SEX];
}Personlnfo;
//通讯录
typedef struct Contact
{
	Personlnfo per[MAX_NUMPERSON];
	int usedSize;
}Contact;


enum Option
{
	EXIT,
	ADD,
	SEAR,
	DEL,
	SHOW,
	CLEAR,
	SORT
};

void InitContact(Contact *pCon);
void AddContact(Contact *pCon);
int SearContact(Contact *pCon);    //找到返回下标
void DelContact(Contact *pCon);
void ShowContact(Contact *pCon);
void ClearContact(Contact *pCon);
void SortrContact(Contact *pCon);
#endif

contact.c文件

#define _CRT_SECURE_NO_WARNINGS
#include"contact.h"


void InitContact(Contact *pCon)
{
	assert(pCon != NULL);
	pCon->usedSize = 0;
	memset(pCon->per, 0, sizeof(pCon->per));
}

void AddContact(Contact *pCon)
{
	if (pCon->usedSize == MAX_NUMPERSON)
	{
		printf("通讯录存满\n");
		return;
	}
	printf("姓名:");
	scanf("%s", pCon->per[pCon->usedSize].name);
	printf("年龄:");
	scanf("%d", &pCon->per[pCon->usedSize].age);
	printf("性别:");
	scanf("%s", pCon->per[pCon->usedSize].sex);
	printf("电话:");
	scanf("%s", pCon->per[pCon->usedSize].tele);
	printf("地址:");
	scanf("%s", pCon->per[pCon->usedSize].addr);
	pCon->usedSize++;
	printf("添加成功\n");
}

int SearContact(Contact *pCon)
{
	int i = 0;
	char find[MAX_NAME] = { 0 };
	assert(pCon != NULL);
	if (pCon->usedSize == 0)
	{
		printf("通讯录中未存储信息\n");
		return -1;
	}

	printf("请输入姓名:");
	scanf("%s", find);
	for (i = 0; i < pCon->usedSize; i++)
	{
		if (strcmp(find, pCon->per[i].name) == 0)
			return i;
	}
	printf("查无此人\n");
	return -1;
}

void DelContact(Contact *pCon)
{
	int i = 0;
	int ret = SearContact(pCon);
	assert(pCon != NULL);
	if (ret == -1)
		printf("查无此人");
	for (i = ret; i < pCon->usedSize-1; i++)
	{
		strcpy (pCon->per[i].addr , pCon->per[i + 1].addr);
		pCon->per[i].age = pCon->per[i + 1].age;
		strcpy(pCon->per[i].name, pCon->per[i + 1].name);
		strcpy(pCon->per[i].sex, pCon->per[i + 1].sex);
		strcpy(pCon->per[i].tele, pCon->per[i + 1].tele);
	}
	pCon->usedSize--;
	printf("删除成功\n");
}
void ShowContact(Contact *pCon)
{
	int i = 0;
	assert(pCon != NULL);
	if (pCon->usedSize == 0)
	{
		printf("通讯录中未存储信息\n");
		return ;
	}
	printf("%-6s%-6s%-6s%-15s%-20s\n","姓名","年龄","性别","电话","地址");
	for (i = 0; i < pCon->usedSize; i++)
	{
		printf("%-6s", pCon->per[i].name);
		printf("%-6d", pCon->per[i].age);
		printf("%-6s", pCon->per[i].sex);
		printf("%-15s", pCon->per[i].tele);
		printf("%-20s\n", pCon->per[i].addr);
	}
}

void ClearContact(Contact *pCon)
{
	assert(pCon != NULL);
	InitContact(pCon);
	printf("初始化成功\n");
}

void change(Contact *pCon, int i)
{
	char tmp[MAX_STR] = { 0 };
	int age = 0;
	{
		strcpy(tmp, pCon->per[i].addr);
		age = pCon->per[i].age;
		strcpy(tmp, pCon->per[i].name);
		strcpy(tmp, pCon->per[i].sex);
		strcpy(tmp, pCon->per[i].tele);
	}
	{
		strcpy(pCon->per[i].addr, pCon->per[i + 1].addr);
		pCon->per[i].age = pCon->per[i + 1].age;
		strcpy(pCon->per[i].name, pCon->per[i + 1].name);
		strcpy(pCon->per[i].sex, pCon->per[i + 1].sex);
		strcpy(pCon->per[i].tele, pCon->per[i + 1].tele);
	}
	{
		strcpy(pCon->per[i+1].addr, tmp);
		pCon->per[i+1].age = age;
		strcpy(pCon->per[i+1].name, tmp);
		strcpy(pCon->per[i+1].sex, tmp);
		strcpy(pCon->per[i+1].tele, tmp);
	}
}

void SortrContact(Contact *pCon)
{
	int i = 0;
	int j = 0;
	int folg = 0;
	for (i = 0; i < pCon->usedSize - 1; i++)
	{
		folg = 0;
		for (j = 0; j < pCon->usedSize - i - 1; j++)
		{
			if (strcmp(pCon->per[j].name, pCon->per[j + 1].name)>0)
			{
				folg = 1;
				change(pCon, j);
			}
		}
		if (folg == 0)
			break;
	}
	printf("排序成功\n");
}

test.c文件

#define _CRT_SECURE_NO_WARNINGS
#include "contact.h"
void menu()
{
	printf("******1.add*************2.search*********\n");
	printf("******3.del*************4.show**********\n");
	printf("******5.clear***********6.sort**********\n");
	printf("******0.exit****************************\n");
}

void start()
{
	int ret = 0;
	int input = 0;
	//创建通讯录
	Contact con;
	//初始化通讯录
	InitContact(&con);
	do
	{
		menu();
		printf("请输入你的操作:");
		scanf("%d", &input);
		switch (input)
		{
		case ADD:    // 添加
			AddContact(&con);
			break;
		case SEAR:     //查找
			ret = SearContact(&con);
			printf("%-6s%-6s%-6s%-15s%-20s\n", "姓名", "年龄", "性别", "电话", "地址");
			printf("%-6s", con.per[ret].name);
			printf("%-6d", con.per[ret].age);
			printf("%-6s", con.per[ret].sex);
			printf("%-15s", con.per[ret].tele);
			printf("%-20s\n", con.per[ret].addr);
			break;
		case DEL:     //删除
			DelContact(&con);
			break;
		case SHOW:    //显示
			ShowContact(&con);
			break;
		case CLEAR:     //清空
			ClearContact(&con);
			break;
		case SORT:    //以姓名排序
			SortrContact(&con);
			break;
		default:
			break;
		}
	} while (input);
}


int main()
{
	start();
	system("pause");
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值