C语言实现简单的通讯录管理系统

其他 2018-08-10 00:06:12 阅读次数: 0

头文件：

#ifndef __ADDRESS_LIST__
#define __ADDRESS_LIST__
#define _CRT_SECURE_NO_WARNINGS 1
#define MAXSIZE 1000//定义通讯录最大存储人数为1000
typedef struct LinkMan//定义存储的结构体
{
    char _name[20];//姓名
    int _age;//年龄
    enum Sex//性别
    {
        MAN,
        WOMAN,
        SECERT
    }Sex;
    long long int _Tel;//电话
    char _address[50];//地址
    int _order;//序号
}LinkManNode,*PLinkManNode;
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<string.h>
/////////////////////////////////////////
void AddressListInit(PLinkManNode* AddressList);
void InputLinkMan(PLinkManNode AddressList);
void CoverLinkMan(PLinkManNode AddressList, int order);
void DeleteLinkMan(PLinkManNode* PAddressList, int order);
void FindLinkManByName(PLinkManNode PAddressList, char name[20]);
void PrintLinkManByOrder(PLinkManNode PAddressList, int order);
void FindLinkManByOrder(PLinkManNode PAddressList, int order);
void AmendLinkManByName(PLinkManNode PAddressList, char name[20]);
void AmendLinkManByOrder(PLinkManNode PAddressList, int order);
void SwapLinkMan(PLinkManNode pLinkMan_1, PLinkManNode pLinkMan_2);
void SortByName(PLinkManNode *PAddressList);
void Menu();
void TestAddressList();
#endif//__ADDRESS_LIST__

AddressList.c:

#include"AddressList.h"
int Size = 1000;
//初始化
void AddressListInit(PLinkManNode* PAddressList)
{
    PLinkManNode PList = NULL;
    assert(PAddressList);

    //为通讯录申请空间
    PList = (PLinkManNode)malloc(sizeof(LinkManNode)* MAXSIZE);
    if (NULL == PList)
    {
        assert(0);
        return;
    }

    *PAddressList = PList;
}
//输入联系人信息并保存
void InputLinkMan(PLinkManNode AddressList)
{
    printf("NAME:");
    scanf("%s", &(AddressList+(MAXSIZE-Size))->_name);
    printf("AGE:");
    scanf("%d", &(AddressList + (MAXSIZE - Size))->_age);
    printf("SEX:0.MAN,1.WOMAN,2.SECERT");
    scanf("%d", &(AddressList + (MAXSIZE - Size))->Sex);
    printf("TEL:");
    scanf("%lld", &(AddressList + (MAXSIZE - Size))->_Tel);
    printf("ADDRESS:");
    scanf("%s", &(AddressList + (MAXSIZE - Size))->_address);
}
//添加联系人
void AddressListPush(PLinkManNode* PAddressList)
{
    assert(PAddressList);

    //判断是否有空间来存储联系人
    if (NULL == *PAddressList)
        return;

    //判断剩余空间大小
    if (Size <= 0)
    {
        printf("存储空间不足\n");
        return;
    }
    //输入联系人信息并保存
    InputLinkMan(*PAddressList);

    //给输入的联系人编号
    ((*PAddressList) + (MAXSIZE - Size))->_order = MAXSIZE - Size + 1;

    //使剩余容量减1
    Size--;
}

//删除联系人
void CoverLinkMan(PLinkManNode AddressList, int order)
{
    //让要删除的联系人后面的联系人都向前挪动一次，覆盖掉要删除的联系人
    while (order <= (MAXSIZE - Size - 1))
    {
        strcpy((AddressList + order - 1)->_name, (AddressList + order)->_name);
        strcpy((AddressList + order - 1)->_address, (AddressList + order)->_address);
        (AddressList + order - 1)->_age = (AddressList + order)->_age;
        (AddressList + order - 1)->Sex = (AddressList + order)->Sex;
        (AddressList + order - 1)->_Tel = (AddressList + order)->_Tel;
        order++;
    }
}
//删除联系人（通过联系人序号）
void DeleteLinkMan(PLinkManNode* PAddressList,int order)
{
    assert(PAddressList);

    //判断通讯录中是否存在联系人
    if (Size == 1000)
    {
        printf("ENPTY\n");
        return;
    }

    //判断序号合法性
    if (order > (MAXSIZE - Size))
    {
        printf("HAVE NO THIS LINKMAN!\n");
        return;
    }

    //删除联系人
    CoverLinkMan(*PAddressList, order);

    //容量加1
    Size++;
}
//通过序号打印联系人信息
void PrintLinkManByOrder(PLinkManNode PAddressList, int order)
{
    printf("%d.\n", order);
    printf("NAME:%s", (PAddressList + order - 1)->_name);
    printf("\n");
    printf("AGE:%d", (PAddressList + order - 1)->_age);
    printf("\n");
    switch ((PAddressList + order - 1)->Sex)
    {
    case 0:printf("SEX:MAN\n");break;
    case 1:printf("SEX:WOMAN\n"); break;
    case 2:printf("SEX:SECERT\n"); break;
    default:printf("SEX:SECERT\n"); break;
    }
    printf("TEL:%lld", (PAddressList + order - 1)->_Tel);
    printf("\n");
    printf("ADDRESS:%s", (PAddressList + order - 1)->_address);
    printf("\n");
}
//查找指定联系人信息
//姓名查找
void FindLinkManByName(PLinkManNode PAddressList, char name[20])
{
    int i = 1;

    //遍历联系人列表，通过姓名查找联系人
    for (i = 1; i <= MAXSIZE - Size; i++)
    {
        if (0 == strcmp(name, (PAddressList + i - 1)->_name))
        {
            printf("The contact person's order to look for is %d.\n", i);
            PrintLinkManByOrder(PAddressList, i);
            return;
        }
    }

    printf("No contact was found.\n");
}
//序号查找
void FindLinkManByOrder(PLinkManNode PAddressList, int order)
{
    //判断联系人序号合法性
    if (order > MAXSIZE - Size)
    {
        printf("HAVE NO THIS LINKMAN!\n");
        return;
    }
    PrintLinkManByOrder(PAddressList, order);
}
//修改指定联系人信息
//通过序号修改
void AmendLinkManByOrder(PLinkManNode PAddressList, int order)
{
    //判断通讯录中是否有联系人
    if (1000 == Size)
    {
        printf("LinkMan enmty!\n");
        return;
    }

    //修改联系人信息
    printf("Old value:\n");
    PrintLinkManByOrder(PAddressList, order);
    printf("amend:\n");
    printf("NAME:");
    scanf("%s", &(PAddressList+order-1)->_name);
    printf("AGE:");
    scanf("%d", &(PAddressList + order - 1)->_age);
    printf("SEX:0.MAN,1.WOMAN,2.SECERT");
    scanf("%d", &(PAddressList + order - 1)->Sex);
    printf("TEL:");
    scanf("%lld", &(PAddressList + order - 1)->_Tel);
    printf("ADDRESS:");
    scanf("%s", &(PAddressList + order - 1)->_address);
}
//通过姓名修改
void AmendLinkManByName(PLinkManNode PAddressList, char name[20])
{
    int i = 1;
    //通过姓名查找联系人
    for (i = 1; i <= MAXSIZE - Size; i++)
    {
        if (0 == strcmp(name, (PAddressList + i - 1)->_name))
        {
            //修改信息
            AmendLinkManByOrder(PAddressList, i);
            return;
        }
    }
    printf("No contact was found.\n");
}
//清空所有联系人
void ClearLinkMan()
{
    Size = 1000;
}
//打印所有联系人
void PrintAllLinkMan(PLinkManNode PAddressList)
{
    int i = 1;
    if (1000 == Size)
    {
        printf("LINKMAN EMPTY!\n");
        return;
    }
    for (i = 1; i <= MAXSIZE - Size; i++)
    {
        PrintLinkManByOrder(PAddressList, i);
    }
}
//交换两个联系人结点信息
void SwapLinkMan(PLinkManNode pLinkMan_1, PLinkManNode pLinkMan_2)
{
    long long int tel_tmp = 0;
    int Sex_tmp = 0;
    int age_tmp = 0;
    char name_tmp[20] = { '0' };
    char address_tmp[50] = { '0' };
    strcpy(name_tmp, pLinkMan_1->_name);
    strcpy(pLinkMan_1->_name, pLinkMan_2->_name);
    strcpy(pLinkMan_2->_name, name_tmp);
    strcpy(address_tmp, pLinkMan_1->_address);
    strcpy(pLinkMan_1->_address, pLinkMan_2->_address);
    strcpy(pLinkMan_2->_address, address_tmp);
    age_tmp = pLinkMan_1->_age;
    pLinkMan_1->_age = pLinkMan_2->_age;
    pLinkMan_2->_age = age_tmp;
    Sex_tmp = pLinkMan_1->Sex;
    pLinkMan_1->Sex = pLinkMan_2->Sex;
    pLinkMan_2->Sex = Sex_tmp;
    tel_tmp = pLinkMan_1->_Tel;
    pLinkMan_1->_Tel = pLinkMan_2->_Tel;
    pLinkMan_2->_Tel = tel_tmp;
}
//以姓名排序联系人列表
void SortByName(PLinkManNode *PAddressList)
{
    int i = 1;
    int j = 1;
    assert(PAddressList);
    if (NULL == *PAddressList)
    {
        printf("LinkMan is gone!\n");
        return;
    }
    if (1000 == Size)
    {
        printf("LINKMAN ENPTY!\n");
        return;
    }
    for (i = MAXSIZE-Size; i > 1; i--)
    {
        for (j = 1; j < i; j++)
        {
            if (strcmp(((*PAddressList) + j - 1)->_name, ((*PAddressList) + j)->_name)>0)
            {
                SwapLinkMan((*PAddressList) + j - 1, (*PAddressList) + j);
            }
        }
    }
    printf("DONE!\n");
}
//菜单
void Menu()
{
    printf("++++++++++++++++++++++++++++++++++++\n");
    printf("++++++++++++1.AddLinkMan++++++++++++\n");
    printf("++++++++++++2.DeleteLinkMan+++++++++\n");
    printf("++++++++++++3.AmendLinkMan++++++++++\n");
    printf("++++++++++++4.FindLinkMan+++++++++++\n");
    printf("++++++++++++5.PrintAllLinkMan+++++++\n");
    printf("++++++++++++6.ClearAllLinkMan+++++++\n");
    printf("++++++++++++7.SortLinkManByName+++++\n");
    printf("++++++++++++8,Exit++++++++++++++++++\n");
    printf("++++++++++++++++++++++++++++++++++++\n");
    printf("++++++++++++++++++++++++++++++++++++\n");
}
//////////////////////////////////////
void TestAddressList()
{
    int num = 0;
    int amend = 0;
    int amendorder = 0;
    char amendname[20] = { '0' };
    int del = 0;
    PLinkManNode AddressList;//创建通讯录
    AddressListInit(&AddressList);//初始化

    while (1)
    {
        Menu();
        printf("choose:");
        scanf("%d", &num);
        switch (num)
        {
        case 1:AddressListPush(&AddressList);
            break;
        case 2:printf("please show your order:");
            scanf("%d", &del);
            DeleteLinkMan(&AddressList, del);
            break;
        case 3:printf("1.by order.2.by name:");
            scanf("%d", &amend);
            switch (amend)
            {
            case 1:printf("show our order:");
                scanf("%d", &amendorder);
                AmendLinkManByOrder(AddressList, amendorder);
                break;
            case 2:printf("show your name:");
                scanf("%s", amendname);
                AmendLinkManByName(AddressList, amendname);
                break;
            default:
                printf("error\n");
                break;
            }
            break;
        case 4:printf("1.by order.2.by name:");
            scanf("%d", &num);
            switch (num)
            {
            case 1:printf("please show your order:");
                scanf("%d", &amend);
                FindLinkManByOrder(AddressList, amend);
                break;
            case 2:printf("please show your name:");
                scanf("%s", amendname);
                FindLinkManByName(AddressList, amendname);
                break;
            default:printf("error\n");
                break;
            }
            break;
        case 5:PrintAllLinkMan(AddressList);
            break;
        case 6:ClearLinkMan();
            break;
        case 7:SortByName(&AddressList);
            break;
        case 8:free(AddressList);
            exit(1);
            break;
        default:printf("error\n");
            break;
        }
    }
}

test.c:

#include"AddressList.h"
int main()//主函数
{
    TestAddressList();//通讯录执行函数
    return 0;
}

猜你喜欢

转载自blog.csdn.net/h___q/article/details/81506104
今日推荐
富文本编辑器 Quill 2.0 重磅发布，特性、可靠性与开发者体验大幅提升
“开源信徒”周鸿祎开源360智脑大模型
周排行
Ubuntu 14.04 下Fuel6.0安装部署
香港一小巴侧翻致1死16伤 警方：未见机件故障
pikachu--XSS盲打
阅读 深入理解JVM虚拟机笔记一
java.sql.SQLException: ORA-00932: 数据类型不一致: 应为 -, 但却获得 CLOB
oracle delete all object under an user
[LeetCode]20 Valid Parentheses 有效的括号
树形DP求树的直径 【模板】
Context propagation over HTTP in Go
【PAT】（B）1053 住房空置率 (20)*
每日归档
更多
2024-04-18(0)
2024-04-17(5)
2024-04-16(70)
2024-04-15(42)
2024-04-14(0)
2024-04-13(119)
2024-04-12(38)
2024-04-11(14)
2024-04-10(68)
2024-04-09(5)

代码天地 © 2018 codetd.com

境外服务器   最新电视剧2022