用顺序表实现的简易通讯录(第一版)


实现一个通讯录;
通讯录可以用来存储1000个人的信息,每个人的信息包括:
姓名、性别、年龄、电话、住址

提供方法:
1.    添加联系人信息
2.    删除指定联系人信息
3.    查找指定联系人信息
4.    修改指定联系人信息
5.    显示所有联系人信息
6.    清空所有联系人
7.    以名字排序所有联系人

//addressbook.h

#pragma once
#define MAX_PEOPLES 100
#define MAX_NAME 20
#define MAX_ADDRESS 50

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

typedef struct tag
{
	char name[MAX_NAME];
	unsigned char age;
	char sex[10];
	char telephone[12];
	char address[MAX_ADDRESS];
}People_t,*PPeople_t;


typedef struct peo
{
	People_t per_mesg[MAX_PEOPLES];
	int count;//实际的人数
}seqlist,*Pseqlist;

enum select{Quit,Add,Delect,Find,Modify,Print,Clear,Sort,};

void add_peo(Pseqlist message);
void print_people_message(Pseqlist message);
void delete_peo_message(Pseqlist message);
void find(Pseqlist message);
static int find_peo(Pseqlist message,char *name);

void modify(Pseqlist message);
void clearall(Pseqlist message);
void sort(Pseqlist message);
void menu();

//adderssbook.c

#include"AddressBook.h"

void menu()
{
	printf("###########################\n");
	printf("#1.add############2.delete#\n");
	printf("#3.find###########4.modiyf#\n");
	printf("#5.print###########6.clear#\n");
	printf("#7.sort###########0.quit##\n");
	printf("###########################\n");

}



void add_peo(Pseqlist message)
{
	assert(message);
	if (message->count > MAX_PEOPLES)
	{
		printf("通讯录已满\n");
		return;
	}
	printf("姓名:>");
	scanf("%s",message->per_mesg[message->count].name);
	printf("年龄:>");
	scanf("%d",&message->per_mesg[message->count].age);
	printf("性别:>");
	scanf("%s",message->per_mesg[message->count].sex);
	printf("电话:>");
	scanf("%s",message->per_mesg[message->count].telephone);
	printf("地址:>");
	scanf("%s",message->per_mesg[message->count].address);
	
	message->count++;

}

void print_people_message(Pseqlist message)
{
	assert(message);
	for (int i = 0; i < message->count; i++)
	{
		printf("name : %s  ",message->per_mesg[i].name );
		printf("age : %d  ",message->per_mesg[i].age );
		printf("sex : %s  ",message->per_mesg[i].sex);
		printf("telephone : %s  ",message->per_mesg [i].telephone);
		printf("address : %s  ",message->per_mesg [i].address);
		printf("\n");
	}
}

static int find_peo(Pseqlist message,char *name)
{
	assert(message);
	assert(name);
	int i = 0;
	for (i = 0; i < message->count; i++)
	{
		if (strcmp(name,message->per_mesg[i].name ) == 0)
		{
			return i;
		}
	}
	return -1;
}




void delete_peo_message(Pseqlist message)
{
	assert(message);
	if ( message->count <= 0)
	{
		printf("通讯录为空\n");
		return ;
	}
	printf("请输入要删除的联系人姓名:>");
	char name[10];
	scanf("%s",name);
	int ret = find_peo(message,name);
	if (ret != -1)
	{
		for (int j = ret; j < message->count; j++)
		{
			message->per_mesg[j] = message->per_mesg[j+1];
		}
		printf("删除成功\n");
		message->count--;
		return ;
	}
	else
	{
		printf("通讯录中没有要删除的联系人\n");
	}
}	

void find(Pseqlist message)
{
	assert(message);
	if ( message->count <= 0)
	{
		printf("通讯录为空\n");
		return ;
	}
	printf("请输入你要查找联系人的姓名:>");
	char name[10];
	scanf("%s",name);
	int ret = find_peo(message,name);
	if (ret != -1)
	{
		printf("name : %s age: %d sex : %s telephone : %s address %s\n",\
				message->per_mesg[ret].name,message->per_mesg[ret].age,message->per_mesg[ret].sex,\
				message->per_mesg[ret].telephone,message->per_mesg[ret].address);
	}	
	else
	{
		printf("没有找到该联系人\n");
	}
}

void modify(Pseqlist message)
{
	assert(message);
	if ( message->count <= 0)
	{
		printf("通讯录为空\n");
		return ;
	}
	printf("请输入要修改联系人的姓名:>");
	char name[10];
	scanf("%s",name);
	int ret = find_peo(message,name);
	if (ret != -1)
	{
		printf("请输入要修改后的名字:>");
		scanf("%s",message->per_mesg[ret].name);

		printf("请输入修改后的年龄:>");
		scanf("%d",&message->per_mesg[ret].age);
		
		printf("请输入修改后的性别:>");
		scanf("%s",message->per_mesg[ret].sex);
		
		printf("请输入修改后的电话:>");
		scanf("%s",message->per_mesg[ret].telephone);
		
		printf("请输入要修改后的地址:>");
		scanf("%s",message->per_mesg[ret].address);
		printf("修改成功:\n");

	}
	else
	{
		printf("要修改的联系人不存在\n");
	}
}

void clearall(Pseqlist message)
{
	assert(message);
	memset(message->per_mesg,0,sizeof(message->per_mesg));
}


void sort(Pseqlist message)
{
	//冒泡排序
	assert(message);
	if ( message->count <= 0)
	{
		printf("通讯录为空\n");
		return ;
	}
	for (int i = 0; i < message->count-1; i++)
	{
		int flag = 1;
		for (int j = 0; j < message->count-1-i; j++)
		{
			if (strcmp(message->per_mesg[j].name,message->per_mesg[j+1].name) > 0)
			{
				flag  = 0;
				People_t tmp = message->per_mesg[j];
				message->per_mesg[j] = message->per_mesg[j+1];
				message->per_mesg[j+1] =tmp;
			}
		}
		if (flag)
		{
			break;
		}
	}
}

//test.c

#include"AddressBook.h"

int main()
{
	seqlist pro;
	pro.count = 0;
	while (1)
	{
		menu();
		printf("请选择:>");
		int select = 0;
		scanf("%d",&select);
		switch(select)
		{
			case Add:
				add_peo(&pro);
				break;
			case Delect:
				delete_peo_message(&pro);
				break;
			case Find:
				find(&pro);
				break;
			case Modify:
				modify(&pro);
				break;
			case Print:
				print_people_message(&pro);
				break;
			case Clear:
				clearall(&pro);
				break;
			case Sort:
				sort(&pro);
				break;
			case Quit:
				exit(0);
			default :
				break;	  
	}

	}
	system("pause");
	return 0;
}







评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值