#define _CRT_SECURE_NO_WARNINGS
#include""
int chcode(struct code*ps)
{
FILE* pt = fopen("C:\\c\\c2\\", "r");
if (pt == NULL)
{
printf("%s\n", strerror(errno));
return;
}
fscanf(pt, "%s %s", ps->ter, ps->arr2);
int i, m = 0;
char arr[50] = { 0 }, ch;
char ter2[50] = { 0 };//储存账号
while (m < 3)
{
printf("请输入账号\n");
scanf("%s", ter2);
printf("请输入密码\n");
i = 0;
while ((ch = _getch()) != '\r')//获得密码
{
if (ch == '\b' && i > 0)
{
printf("\b \b");
i--;
}
else if (ch != '\b')
{
arr[i++] = ch;
printf("*");
}
}
arr[i] = '\0';
printf("\n");
if (strcmp(arr,ps->arr2) != 0 || strcmp(ter2,ps->ter) != 0)
{
printf("输入密码或账号错误\n");
m++;
}
else if (strcmp(arr,ps->arr2) == 0 && strcmp(ter2,ps->ter) == 0)
{
printf("账号输入正确\n");
return 1;
}
}
printf("输入错误三次，退出输入\n");
return 0;
}
void modifycode(struct code*ps)
{
FILE* pt = fopen("C:\\c\\c2\\", "wb");
if (pt == NULL)
{
printf("%s", strerror(errno));
return;
}
int i=0;
char ch;
printf("请重新输入账号\n");
scanf("%s", ps->ter);
printf("请重新输入密码\n");
while ((ch = _getch()) != '\r')//获得密码
{
if (ch == '\b' && i > 0)
{
printf("\b \b");
i--;
}
else if (ch != '\b')
{
ps->arr2[i++] = ch;
printf("*");
}
}
ps->arr2[i] = '\0';
fprintf(pt, "%s %s", ps->ter, ps->arr2);
fclose(pt);
pt = NULL;
printf("\n修改ID账号成功\n");
}
void addid(struct code* ps)
{
FILE* pt = fopen("C:\\c\\c2\\", "wb");
if (pt == NULL)
{
printf("%s", strerror(errno));
return;
}
int i=0;
char ch;
printf("请输入账号\n");
scanf("%s", ps->ter);
printf("请输入密码\n");
while ((ch = _getch()) != '\r')//获得密码
{
if (ch == '\b' && i > 0)
{
printf("\b \b");
i--;
}
else if (ch != '\b')
{
ps->arr2[i++] = ch;
printf("*");
}
}
ps->arr2[i] = '\0';
fprintf(pt, "%s %s", ps->ter, ps->arr2);
fclose(pt);
pt = NULL;
printf("\n添加账号成功\n");
}
void initcontact(struct Contact* ps)
{
ps->date = (struct Peoinfo*)malloc(DEFINESZ * sizeof(struct Peoinfo));
if (ps->date == NULL)
{
return;
}
ps->size = 0;
ps->capacity = DEFINESZ;
readcontact(ps);
}
void checkcapacity(struct Contact* ps);//声明checkcapacity
void readcontact(struct Contact* ps)
{
struct Peoinfo tmp = { 0 };
FILE* pr = fopen("C:\\c\\c2\\", "rb");
if (pr == NULL)
{
printf("readcontact:%s", strerror(errno));
return;
}
while (fread(&tmp, sizeof(struct Peoinfo), 1, pr))
{
checkcapacity(ps);
ps->date[ps->size] = tmp;
ps->size++;
}
fclose(pr);
pr = NULL;
}
void checkcapacity(struct Contact* ps)
{
if (ps->size == ps->capacity)
{
//增容
struct Peoinfo* ptr = realloc(ps->date, (ps->capacity + 2) * sizeof(struct Peoinfo));
if (ptr != NULL)
{
ps->date = ptr;
ps->capacity += 2;
printf("增容成功\n");
}
else
{
printf("增容失败\n");
}
}
}
void addcontact(struct Contact* ps)
{
checkcapacity(ps);
printf("请输入名字\n");
scanf("%s", ps->date[ps->size].name);
printf("请输入年龄\n");
scanf("%d", &(ps->date[ps->size].age));//年龄不是数组要用&
printf("请输入性别\n");
scanf("%s", ps->date[ps->size].sex);
printf("请输入电话\n");
scanf("%s", ps->date[ps->size].tele);
printf("请输入地址\n");
scanf("%s", ps->date[ps->size].addr);
printf("添加成功\n");
ps->size++;
}
void showcontact(const struct Contact* ps)
{
int i = 0;
if (ps->size == 0)
{
printf("通讯录为空\n");
}
else
{
printf("%-20s\t%-5s\t%-5s\t%-12s\t%-20s\n", "名字", "年龄", "性别", "电话", "地址");
for (i = 0; i < ps->size; i++)
{
printf("%-20s\t%-5d\t%-5s\t%-12s\t%-20s\n",
ps->date[i].name,
ps->date[i].age,
ps->date[i].sex,
ps->date[i].tele,
ps->date[i].addr);
}
}
}
int findname(const struct Contact* ps, char name[])
{
int i = 0;
for (i = 0; i < ps->size; i++)
{
if (0 == strcmp(ps->date[i].name, name))
{
return i;//找到返回下标
}
}
return -1;//未找到返回-1
}
void delcontact(struct Contact* ps)
{
char name[MAX_NAME];
printf("输入要删除人的名字：\n");
scanf("%s", name);
int ret = findname(ps, name);
if (-1 == ret)
{
printf("未找到数据\n");
}
else
{
int j = 0;
for (j = ret; j < ps->size - 1; j++)
{
ps->date[j] = ps->date[j + 1];
}
ps->size--;
printf("删除成功\n");
}
}
void searchcontact(const struct Contact* ps)
{
char name[MAX_NAME];
printf("请输入要查找的名字：\n");
scanf("%s", name);
int ret = findname(ps, name);
if (-1 == ret)
{
printf("未查找到相关数据\n");
}
else
{
printf("%-20s\t%-5s\t%-5s\t%-12s\t%-20s\n", "名字", "年龄", "性别", "电话", "地址");
printf("%-20s\t%-5d\t%-5s\t%-12s\t%-20s\n",
ps->date[ret].name,
ps->date[ret].age,
ps->date[ret].sex,
ps->date[ret].tele,
ps->date[ret].addr);
}
}
void modifycontact(struct Contact* ps)
{
char name[MAX_NAME];
printf("输入要修改成员的名字：\n");
scanf("%s", name);
int ret = findname(ps, name);
if (-1 == ret)
{
printf("未找到数据\n");
}
else
{
printf("请输入名字\n");
scanf("%s", ps->date[ret].name);
printf("请输入年龄\n");
scanf("%d", &(ps->date[ret].age));//年龄不是数组要用&
printf("请输入性别\n");
scanf("%s", ps->date[ret].sex);
printf("请输入电话\n");
scanf("%s", ps->date[ret].tele);
printf("请输入地址\n");
scanf("%s", ps->date[ret].addr);
printf("修改成功\n");
}
}
//void sortcontact(struct Contact* ps)//按名字排序，冒泡排序
//{
// int i = 0;
// int j = 0;
// for ( i = 0; i < ps->size-1; i++)//排序的趟数
// {
// for (j = 0; j < ps->size - 1 - i; j++)
// {
// if (strcmp(ps->date[j].name,ps->date[j+1].name)>0)
// {
// struct Peoinfo tem = ps->date[j];
// ps->date[j] = ps->date[j + 1];
// ps->date[j + 1] = tem;
// }
// }
// }
//
//}
//冒泡排序的第二种实现
void sortcontact(struct Contact* ps)
{
int j = 0;
int flag = 0;
while (1)
{
flag = 0;
for (j = 0; j < ps->size - 1; j++)
{
if (strcmp(ps->date[j].name, ps->date[j + 1].name) > 0)
{
struct Peoinfo tem = ps->date[j];
ps->date[j] = ps->date[j + 1];
ps->date[j + 1] = tem;
flag = 1;//有逆序，赋值为1
}
}
if (0 == flag)//当全没有逆序时，跳出循环
{
break;
}
}
}
void destroycontact(struct Contact* ps)//释放动态内存
{
free(ps->date);
ps->date = NULL;
}
void savecontact(struct Contact* ps)
{
FILE* pr = fopen("C:\\c\\c2\\", "wb");
if (pr == NULL)
{
printf("%s", strerror(errno));
return;
}
int i = 0;
for (i = 0; i < ps->size; i++)
{
fwrite(&(ps->date[i]), sizeof(struct Peoinfo), 1, pr);
}
fclose(pr);
pr = NULL;
}