#ifndef __CONTACT_H__
#define __CONTACT_H__
#define MAX 1000
#define NAME_MAX 20
#define SEX_MAX 10
#define TELE_MAX 12
#define ADDR_MAX 20
enum Option
{
EXIT,
ADD,
DEL,
SEARCH,
MODIFY,
SHOW,
CLEAR,
SORT,
SAVE
};
typedef struct PeoInfo
{char name[NAME_MAX];
int age;
char sex[SEX_MAX];
char tele[TELE_MAX];
char addr[ADDR_MAX];
}PeoInfo;
typedef struct Contact
{struct PeoInfo data[MAX];int sz;
}Contact,* pContact;
void InitContact(pContact pc);
void AddContact(pContact pc);
void ShowContact(pContact pc);
void DelContact(pContact pc);
int SearchContact(pContact pc);
void sort_contact(pContact pc);
void ModdifyContact(pContact pc);
void ClearContact(pContact pc);
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include "Contact.h"
#include <string.h>
void ShowContact(pContact pc)
{
int i = 0;
printf("%10s\t%5s\t%5s\t%12s\t%12s\t\n", "name", "age", "sex", "tele", "addr");
for (i = 0; i < pc->sz; i++)
{
printf("%10s\t%5d\t%5s\t%12s\t%12s\t\n", pc->data[i].name,
pc->data[i].age,
pc->data[i].sex,
pc->data[i].tele,
pc->data[i].addr);
}
}
void InitContact(pContact pc)
{
pc->sz = 0;
memset(pc->data, 0, sizeof(pc->data));
}
void AddContact(pContact pc)
{
if (pc->sz==MAX)
{
printf("通讯录已满,无法增加新的联系人\n");
return;
}
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++;
}
int Find(pContact 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 DelContact(pContact pc)
{
char name[NAME_MAX] = { 0 };
int i = 0;
int pos = 0;
if (pc->sz == 0)
{
printf("通讯录为空,无法删除\n");
return;
}
printf("请输入要删除人的名字:>");
scanf("%s", name);
pos = Find(pc, name);
if (i == pc->sz)
{
printf("要删除的人不存在\n");
}
for (pos = i; pos < pc->sz-1; pos++)
{
pc->data[pos] = pc->data[pos + 1];
}
pc->sz--;
}
int SearchContact(pContact pc)
{
int pos = 0;
char name[NAME_MAX] = { 0 };
printf("请输入要查找联系人的名字:>");
scanf("%s", name);
pos = Find(pc, name);
if (pos == -1)
{
printf("查找的联系人不存在\n");
return -1;
}
else
{
printf("%10s\t%5d\t%5s\t%12s\t%12s\t\n", pc->data[pos].name,
pc->data[pos].age,
pc->data[pos].sex,
pc->data[pos].tele,
pc->data[pos].addr);
return pos;
}
}
void ModdifyContact(pContact pc)
{
int ret = SearchContact(pc);
if (ret != -1)
{
printf("请输入要修改联系人的信息:>");
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);
}
else
{
printf("无法修改\n");
}
}
void sort_contact(pContact pc)
{
int i = 0;
int j = 0;
for (i = 0; i < pc->sz; i++)
{
for (j = 0; j < pc->sz -1 - i; j++)
{
if (strcmp(pc->data[j].name, pc->data[j+1].name)>0)
{
PeoInfo tmp = pc->data[j];
pc->data[j] = pc->data[j+1];
pc->data[j+1] = tmp;
}
}
}
}
void ClearContact(pContact pc)
{
pc->sz = 0;
printf("已清空通讯录\n");
}
bool IncCapacity(pCcontact *pc){
Student *temp = NULL;
assert(ml != NULL);
ml->capacity = ml->capacity + MAX;
temp = (Student*)realloc(ml->data, sizeof(Student)*ml->capacity);
if (temp != NULL){
ml->data = temp;
return 1;
}
else
return 0;
}
#define _CRT_SECURE_NO_WARNINGS 1
#include "Contact.h"
#include <stdio.h>
void menu()
{
printf("****************************\n");
printf("*** 1.ADD 2.DEL ***\n");
printf("*** 3.SEARCH 4.MODIFY***\n");
printf("*** 5.SHOW 6.CLEAR ***\n");
printf("*** 7.SORT 0.EXIT ***\n");
printf("*** 8.SAVE ***\n");
printf("****************************\n");
}
void test()
{
int input = 0;
char name[NAME_MAX] = { 0 };
struct Contact con;
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:
ModdifyContact(&con);
break;
case SHOW:
ShowContact(&con);
break;
case CLEAR:
ClearContact(&con);
case SORT:
sort_contact(&con);
default:
break;
}
} while (input);
}
int main()
{
test();
system("pause");
return 0;
}
通讯录内存的动态开辟
最新推荐文章于 2023-03-10 02:08:18 发布