C语言实现通讯录

原创

一定要上进 2021-10-24 21:38:16 ©著作权

文章标签 #define #include i++ 4s 初始化 文章分类 C/C++ 后端开发

©著作权归作者所有：来自51CTO博客作者一定要上进的原创作品，请联系作者获取转载授权，否则将追究法律责任

一。主程序：

#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;//con就是通讯录，里面包含：1000个元素的数和size


  //初始化通讯录

  InfoContact(&con);
  do
  {
    menu();
    printf("请输入>\n");
    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);
      ShowContact(&con);
      break;
    case EXIT:
      printf("退出通讯录\n");
      break;
    default:
      printf("输入错误\n");
      break;
    }

  } while (input);
  return 0;
}

二。通讯录

#define _CRT_SECURE_NO_WARNINGS 1

#include"contact.h"

static int FindByName(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 InfoContact(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("%-20s\t%-4s\t%-5s\t%-12s\t%-20s\n", "名字","年龄","性别","电话","地址");
    for (i = 0; i < ps->size; i++)
    {
      printf("%-20s\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);

    }

  }


}

void DelContact(struct Contact* ps)
{
  printf("请输入删除人的名字:>\n");
  char name[MAX_NAME];
  scanf("%s", &name);
  //1.查找要删除的人的位置
  int pos = FindByName(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)
{
  printf("请输入查找人的名字:>\n");
  char name[MAX_NAME];
  scanf("%s", &name);
  int pos = FindByName(ps, name);
  if (pos == -1)
  {
    printf("查找的人不存在\n");
  }
  else
  {
    printf("%-20s\t%-4s\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(struct Contact* ps)
{
  printf("请输入要修改人的名字:>");
  char name[MAX_NAME];
  scanf("%s", &name);
  int pos = FindByName(ps, name);
  if (pos == -1)
  {
    printf("需要修改的的人不存在\n");
  }
  else
  {
    printf("请输入名字->");
    scanf("%s", ps->data[pos].name);
    printf("请输入年龄->");
    scanf("%d", &(ps->data[pos].age));
    printf("请输入性别->");
    scanf("%s", ps->data[pos].sex);
    printf("请输入电话->");
    scanf("%s", ps->data[pos].tele);
    printf("请输入地址->");
    scanf("%s", ps->data[pos].addr);

    printf("修改成功\n");
  }
}


void Swap(char*buf1, char*buf2, int width) //交换函数 - 利用width，挨个交换字节 完成通用交换数据
{
  int i = 0;
  for (i = 0; i < width; i++)
  {
    char tmp = *buf1;
    *buf1 = *buf2;
    *buf2 = tmp;
    buf1++;
    buf2++;
  }
}

void SortContact( struct Contact* ps)
{
  //int input;
  //printf("请输入按什么类别进行排序:>\n");
  //scanf("%d", &name);

  int i = 0;
  for (i = 0; i < ps->size - 1; i++)
  {
    int j = 0;
    for (j = 0; j < ps->size - 1 - i; j++)
    {
      if (strcmp(ps->data[j].name, ps->data[j + 1].name) > 0)
      {
        //struct PeoInfo tmp = { 0 };
        //tmp = *(ps->data[j]);
        //memcpy(ps->data[j], ps->data[j + 1],67 );
        //memcpy(ps->data[j], ps->data[j + 1],67 );

        Swap(ps->data[j + 1].name, ps->data[j].name, MAX_NAME);
        //Swap((char*)ps->data[j + 1].age, (char*)ps->data[j].age, 4);
        int tmp = 0;
        tmp = ps->data[j].age;
        ps->data[j].age = ps->data[j + 1].age;
        ps->data[j+1].age = tmp;
        Swap(ps->data[j + 1].sex, ps->data[j].sex, MAX_SEX);
        Swap(ps->data[j + 1].tele, ps->data[j].tele, MAX_TELE);
        Swap(ps->data[j + 1].addr, ps->data[j].addr, MAX_ADDR);

      }
    }
  }
  printf("排序完成\n");
}

三。头文件

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

#define MAX 1000

#define MAX_NAME 20
#define MAX_SEX 5
#define MAX_TELE 12
#define MAX_ADDR 30

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];//存放一个信息
  int size;//记录当前已有元素个数
};

void InfoContact(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(struct Contact* ps);
void SortContact(struct Contact* ps);