前言
在生活中,我们需要将许多信息归总到一起,便于使用和查询,使用通讯录就是一个便捷的选择。
一、通讯录基本功能
1.对信息实现增删查改
2.进行排序
3.记录一些基本信息,比如:名字、年龄,姓名、电话、住址等。
预览:
二、静态版通讯录
#define _CRT_SECURE_NO_WARNINGS 1
#include"contact.h"
void InitContact(struct Contact* ps)
{
memset(ps->data,0,sizeof(ps->data));
ps->size = 0;//设置通讯录最初只有0个元素
}
void AddContact(struct Contact* ps)
{
if (ps->size == MAX)
{
printf("通讯录已满,无法增加\n");
}
else
{
printf("请输入名字:>");
scanf("%s", ps->data[ps->size].name);
printf("请输入年龄:>");
scanf("%d", &(ps->data[ps->size].age));
printf("请输入性别:>");
scanf("%s", ps->data[ps->size].sex);
printf("请输入电话:>");
scanf("%s", ps->data[ps->size].tele);
printf("请输入地址:>");
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("%-10s\t%-4s\t%-5s\t%-12s\t%-20s\n", "名字", "年龄", "性别", "电话", "住址");
//数据
for (i = 0; i < ps->size; i++)
{
printf("%-10s\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 FindName(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;
}
}
return -1;
}
void DelContact(struct Contact* ps)
{
char name[MAX_NAME];
printf("请输入输出的人名字\n");
scanf("%s", name);
//1.查找要删除的人在什么位置
//找到了返回名字所在元素的下标
//找不到返回-1
int pos = FindName(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 = FindName(ps, name);
if (pos == -1)
{
printf("要查找的人不存在\n");
}
else
{
printf("%-20s\t%-4d\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(const struct Contact* ps)
{
char name[MAX_NAME];
printf("请输入要修改人的名字\n");
scanf("%s", name);
FindName(ps, name);
int pos = FindName(ps, name);
if (pos == -1)
{
printf("要修改人的信息不存在\n");
}
else
{
printf("请输入名字:>");
scanf("%s", ps->data[ps->size].name);
printf("请输入年龄:>");
scanf("%d", &(ps->data[ps->size].age));
printf("请输入性别:>");
scanf("%s", ps->data[ps->size].sex);
printf("请输入电话:>");
scanf("%s", ps->data[ps->size].tele);
printf("请输入地址:>");
scanf("%s", ps->data[ps->size].addr);
printf("修改完成\n");
}
}
void SortContact(struct Contact* ps)
{
int i = 0;
//外层循环=元素个数-1
for (i = 0; i<ps->size-1; i++)
{
int j = 0;
//内层循环(对比次数)=元素个数-当前轮数-1
for (j = 0; j < ps->size-i-1; j++)
{
if (strcmp(ps->data[j].name, ps->data[j+1].name)<0)
{
struct PeoInfo tmp = ps->data[j];
ps->data[j] = ps->data[j + 1];
ps->data[j + 1] = tmp;
}
}
}
}
#pragma once
#define _CRT_SECURE_NO_WARNINGS 1
#define MAX 1000
#define MAX_NAME 20
#define MAX_SEX 5
#define MAX_TELE 12
#define MAX_ADDR 30
#include<stdio.h>
#include<string.h>
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[MAX];//存放1000个信息
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( const struct Contact* ps);
void SortContact(struct Contact* ps);
#define _CRT_SECURE_NO_WARNINGS 1
#include"contact.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;
//创建通讯录
struct Contact con;//存放1000个人的信息
//初始化通讯录
InitContact(&con);
//
do {
menu();
printf("请选择:>");
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:
SortContact(&con);
break;
case EXIT:
printf("通讯录退出\n");
default:
printf("选择错误\n");
break;
}
}while(input);
return 0;
}
以上为静态版通讯录,实现了基本的增删查改,此外,在排序时,使用冒泡排序,实现功能。
三、动态版通讯录
动态版的通讯录主要是为了在内存不够时实现内存的自动开辟效果
1.添加了一个checkcapacity函数进行增容操作,当然了在初始化的过程中要设置通讯录中的初始元素为0
2.在结束的时候还添加了一个销毁函数DestroyContact,来对内存空间进行释放
3.当然了也得在头文件当中定义函数
#define _CRT_SECURE_NO_WARNINGS 1
#include"contact.h"
void InitContact(struct Contact* ps)
{
ps->data = (struct PeoInfo*)malloc(DEFAULT_SZ * sizeof(struct PeoInfo));
if(ps->data == NULL)
{
return ;
}
ps->size = 0;
ps->capacity = DEFAULT_SZ ;
//memset(ps->data,0,sizeof(ps->data));
//ps->size = 0;//设置通讯录最初只有0个元素
}
void CheckCapacity(struct Contact*ps)
{
if (ps->size==ps->capacity)
{
//增容
PeoInfo* ptr = (PeoInfo*)realloc(ps->data, (ps->capacity + 2) * sizeof(PeoInfo));
if (ptr != NULL)
{
ps->data = ptr;
ps->capacity += 2;
printf("增容成功\n");
}
else
{
printf("增容失败\n");
}
}
}
void AddContact(struct Contact* ps)
{
//检测当前通讯录的容量
//1.满了就增容
//2.没满就不做任何操作
CheckCapacity(ps);
//增加数据
printf("请输入名字:>");
scanf("%s", ps->data[ps->size].name);
printf("请输入年龄:>");
scanf("%d", &(ps->data[ps->size].age));
printf("请输入性别:>");
scanf("%s", ps->data[ps->size].sex);
printf("请输入电话:>");
scanf("%s", ps->data[ps->size].tele);
printf("请输入地址:>");
scanf("%s", ps->data[ps->size].addr);
ps->size++;
printf("添加成功\n");
/*if (ps->size == MAX)
{
printf("通讯录已满,无法增加\n");
}
else
{
printf("请输入名字:>");
scanf("%s", ps->data[ps->size].name);
printf("请输入年龄:>");
scanf("%d", &(ps->data[ps->size].age));
printf("请输入性别:>");
scanf("%s", ps->data[ps->size].sex);
printf("请输入电话:>");
scanf("%s", ps->data[ps->size].tele);
printf("请输入地址:>");
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("%-10s\t%-4s\t%-5s\t%-12s\t%-20s\n", "名字", "年龄", "性别", "电话", "住址");
//数据
for (i = 0; i < ps->size; i++)
{
printf("%-10s\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 FindName(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;
}
}
return -1;
}
void DelContact(struct Contact* ps)
{
char name[MAX_NAME];
int pos = 0;
printf("请输入输出的人名字\n");
scanf("%s", name);
//1.查找要删除的人在什么位置
//找到了返回名字所在元素的下标
//找不到返回-1
pos = FindName(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];
int pos = 0;
printf("请输入要查找人的名字\n");
scanf("%s", name);
pos = FindName(ps, name);
if (pos == -1)
{
printf("要查找的人不存在\n");
}
else
{
printf("%-20s\t%-4d\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(const struct Contact* ps)
{
char name[MAX_NAME];
int pos = 0;
printf("请输入要修改人的名字\n");
scanf("%s", name);
FindName(ps, name);
pos = FindName(ps, name);
if (pos == -1)
{
printf("要修改人的信息不存在\n");
}
else
{
printf("请输入名字:>");
scanf("%s", ps->data[ps->size].name);
printf("请输入年龄:>");
scanf("%d", &(ps->data[ps->size].age));
printf("请输入性别:>");
scanf("%s", ps->data[ps->size].sex);
printf("请输入电话:>");
scanf("%s", ps->data[ps->size].tele);
printf("请输入地址:>");
scanf("%s", ps->data[ps->size].addr);
printf("修改完成\n");
}
}
void SortContact(struct Contact* ps)
{
int i = 0;
//外层循环=元素个数-1
for (i = 0; i<ps->size-1; i++)
{
int j = 0;
//内层循环(对比次数)=元素个数-当前轮数-1
for (j = 0; j < ps->size-i-1; j++)
{
if (strcmp(ps->data[j].name, ps->data[j+1].name)<0)
{
struct PeoInfo tmp = ps->data[j];
ps->data[j] = ps->data[j + 1];
ps->data[j + 1] = tmp;
}
}
}
}
void DestroyContact(Contact* ps)
{
free(ps->data);
ps->data = NULL;
}
#pragma once
#define _CRT_SECURE_NO_WARNINGS 1
//#define MAX 1000
#define MAX_NAME 20
#define MAX_SEX 5
#define MAX_TELE 12
#define MAX_ADDR 30
#define DEFAULT_SZ 3
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
enum Option
{
EXIT,
ADD,
DEL,
SEARCH,
MODIFY,
SHOW,
SORT
};
typedef struct PeoInfo
{
char name[MAX_NAME];
int age;
char sex[MAX_SEX];
char tele[MAX_TELE];
char addr[MAX_ADDR];
}PeoInfo;
//通讯录类型
typedef struct Contact
{
struct PeoInfo *data;//存放1000个信息
int size;//记录已有的元素个数
int capacity;//当前通讯录最大容量
}Contact;
//声明函数
//初始化通讯录的函数
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( const struct Contact* ps);
void SortContact(struct Contact* ps);
void DestroyContact(Contact* ps);
#define _CRT_SECURE_NO_WARNINGS 1
#include"contact.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;
//创建通讯录
struct Contact con;//data指针,size,capacity
//初始化通讯录
InitContact(&con);
//
do {
menu();
printf("请选择:>");
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:
SortContact(&con);
break;
case EXIT:
//销毁通讯录-释放动态开辟的内存
DestroyContact(&con);
printf("通讯录退出\n");
default:
printf("选择错误\n");
break;
}
}while(input);
return 0;
}
总结
以上就是静态+动态版通讯录了,适合刚入门的小白同学,大家可以去试试。