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

头文件:

#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)
{
    
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值