动态通讯录

上次实现了静态版本的通讯录,虽然能够初步满足我们的需求,但总归还是不够完美,那么下面我将次通讯录的静态版本改为动态版本。。。这就需要用到动态分配~
所谓动态分配,就是需要的时候再分配,这是相对于静态分配而言的,静态分配就是一次分配完毕,不管你用多少。而动态分配则是按需分配。

下面我们来具体实现一下呗~
contact.h

#ifndef __CONTACT_H__
#define __CONTACT_H__

#define MAX 1000
#define NAME_MAX 20
#define SEX_MAX 5
#define TELE_MAX 15
#define ADDER_MAX 30

#define DEFAULT_SZ 3//默认大小
#define DEFAULT_INC  2

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

typedef struct PeoInfo//定义个人信息结构体
{
    char name[NAME_MAX];
    long int age;
    char sex[SEX_MAX];
    char tele[TELE_MAX];
    char addr[ADDER_MAX];
}PeoInfo;
typedef struct Contact
{
    PeoInfo *data;//数据存储的区域
    int sz;//统计放入的个数
    int capacity;//容量
}Contact, *pContact;

void InitContact(pContact pcon);//结构体初始化
void AddContact(pContact pcon);
int SearchContact(pContact pcon);
void DelContact(pContact pcon);
void ModifyContact(pContact pcon);
void ShowContact(const pContact pcon);
void SortContact(pContact pcon);
void ClearContact(pContact pcon);
void DestroyContact(pContact pcon);

#endif

contact.c
//函数实现

#define _CRT_SECURE_NO_WARNINGS 1
#include"contact.h"


void InitContact(pContact pcon)
{
    //memset(pcon->data, 0, MAX*sizeof(PeoInfo));
    pcon->sz = 0;//已经放了多少
    pcon->data = malloc(DEFAULT_SZ*sizeof(PeoInfo));
    if (pcon->data == NULL)
    {
        perror("use malloc");//报错
        exit(EXIT_FAILURE);//退出
    }
    memset(pcon->data, 0, DEFAULT_SZ*sizeof(PeoInfo));
    pcon->capacity = DEFAULT_SZ;
}
void CheckCapacity(pContact pcon)
{
    if (pcon->sz == pcon->capacity)
    {
        PeoInfo* ptr = realloc(pcon->data, (pcon->capacity + DEFAULT_INC)*sizeof(PeoInfo));
        if (ptr == NULL)
        {
            perror("realloc");
            exit(EXIT_FAILURE);
        }
        else
        {
            pcon->data = ptr;
        }
        pcon->capacity += DEFAULT_INC;
        printf("增容成功\n");
    }
}

void DestroyContact(pContact pcon)
{
    free(pcon->data);
    pcon->data = NULL;
    pcon->capacity = 0;
    pcon->sz = 0;
}

void AddContact(pContact pcon)
{
    assert(pcon->data);
    CheckCapacity(pcon);

    printf("请输入名字>: ");
    scanf("%s", pcon->data[pcon->sz].name);
    printf("请输入性别>: ");
    scanf("%s", pcon->data[pcon->sz].sex);
    printf("请输入年龄>: ");
    scanf("%d", &pcon->data[pcon->sz].age);
    printf("请输入电话>: ");
    scanf("%s", pcon->data[pcon->sz].tele);
    printf("请输入地址>: ");
    scanf("%s", pcon->data[pcon->sz].addr);
    pcon->sz++;
    printf("录入成功\n");
}

static int FindEntry(pContact pcon, char name[])//static只在当前文件使用
{
    int i = 0;
    for (i = 0; i < pcon->sz; i++)
    {
        if (strcmp(pcon->data[i].name, name) == 0)
        {
            return i;//找到,返回下标
        }
    }
    return -1;//没找到
}

int SearchContact(pContact pcon)//查找信息
{
    char name[NAME_MAX];
    printf("请输入要查找的姓名: ");
    scanf("%s", name);
    int pos = 0;
    pos = FindEntry(pcon, name);
    if (pos == -1)
    {
        printf("你要查找的人不存在\n");
        return;
    }
    else
    {
        printf("name:%10s\t sex:%5s\t age:%5d\t tele:%10s\t addr:%15s\n",
            pcon->data[pos].name,
            pcon->data[pos].sex,
            pcon->data[pos].age,
            pcon->data[pos].tele,
            pcon->data[pos].addr);
    }
}

void ShowContact(pContact pcon)
{
    printf("联系人信息:\n");
    int i = 0;
    printf("%10s\t%5s\t%5s\t%15s\t%20s\n", "name", "sex", "age", "tele", "addr");
    for (i = 0; i < pcon->sz; i++)
    {
        printf("%10s\t%5s\t%5d\t%10s\t%15s\n",
            pcon->data[i].name,
            pcon->data[i].sex,
            pcon->data[i].age,
            pcon->data[i].tele,
            pcon->data[i].addr);
    }
}


void DelContact(pContact pcon)//删除联系人
{
    char name[NAME_MAX];
    printf("请输入要删除的联系人\n");
    scanf("%s", name);
    int pos = 0;//利用pos接收FindEntry返回的地址
    pos = FindEntry(pcon, name);
    if (pos == -1)
    {
        printf("要删除的联系人不存在\n");
        return;
    }
    else
    {
        int j = 0;
        for (j = pos; j < pcon->sz; j++)
        {
            pcon->data[j] = pcon->data[j + 1];//利用后面一个覆盖前一个,从而达到删除的效果
        }
        pcon->sz--;
        printf("删除成功\n");
    }
}


void ModifyContact(pContact pcon)
{
    char name[NAME_MAX];
    printf("请输入要修改的联系人\n");
    scanf("%s", name);
    int pos = 0;//利用pos接收FindEntry返回的地址
    pos = FindEntry(pcon, name);
    if (pos != -1)
    {
        printf("请输入修改后的姓名: ");
        scanf("%s", pcon->data[pcon->sz].name);
        printf("请输入修改后的性别: ");
        scanf("%s", pcon->data[pcon->sz].sex);
        printf("请输入修改后的年龄: ");
        scanf("%d", &pcon->data[pcon->sz].age);
        printf("请输入修改后的电话: ");
        scanf("%s", pcon->data[pcon->sz].tele);
        printf("请输入修改后的地址: ");
        scanf("%s", pcon->data[pcon->sz].addr);
        printf("修改完毕\n");
    }
    else
    {
        printf("要修改的联系人不存在!\n");
    }
}
void SortContact(pContact pcon)
{
    int i = 0;
    int j = 0;
    int k = 0;
    for (i = 0; i < pcon->sz - 1; i++)
    {
        for (j = 0; j<pcon->sz - i - 1; j++)
        {
            if (strcmp(pcon->data[i].name, pcon->data[i + 1].name) > 0)
            {
                struct PeoInfo tmp;
                tmp = pcon->data[j];
                pcon->data[j] = pcon->data[j + 1];
                pcon->data[j + 1] = tmp;
            }
        }
    }
    printf("%10s\t%5s\t%5s\t%15s\t%20s\n", "name", "sex", "age", "tele", "addr");
    for (k = 0; k< pcon->sz; k++)
    {
        printf("%10s\t%5s\t%5d\t%10s\t%15s\n",
            pcon->data[k].name,
            pcon->data[k].sex,
            pcon->data[k].age,
            pcon->data[k].tele,
            pcon->data[k].addr);
    }
}
void ClearContact(pContact pcon)
{
    pcon->sz = 0;
}

test.c
//函数测试

#define _CRT_SECURE_NO_WARNINGS 1
#include"contact.h"

enum
{
    Exit,
    Add,
    Del,
    Search,
    Modify,
    Show,
    Sort,
    Clear,

};

void menu()
{
    printf("#################################\n");
    printf("###########  通讯录   ###########\n");
    printf("###########  0.exit   ###########\n");
    printf("###########  1.add    ###########\n");
    printf("###########  2.del    ###########\n");
    printf("###########  3.search ###########\n");
    printf("###########  4.modify ###########\n");
    printf("###########  5.show   ###########\n");
    printf("###########  6.sort   ###########\n");
    printf("###########  7.clear  ###########\n");
    printf("#################################\n");
}
void test()
{
    Contact my_con;
    InitContact(&my_con);//初始化通讯录
    int input = 0;
    do
    {
        menu();
        printf("请选择>: ");
        scanf("%d", &input);
        switch (input)
        {
        case Exit:
            DestroyContact(&my_con);
            break;
        case Add:
            AddContact(&my_con);//增加联系人
            break;
        case Del:
            DelContact(&my_con);//删除联系人
            break;
        case Search:
            SearchContact(&my_con);//查询联系人
            break;
        case Modify:
            ModifyContact(&my_con);//修改联系人
            break;
        case Show:
            ShowContact(&my_con);//显示联系人
            break;
        case Sort:
            SortContact(&my_con);//对联系人排序,按名字排序
            break;
        case Clear:
            ClearContact(&my_con);//清空通讯录
            break;

            break;
        default:
            printf("输入错误,请重新输入\n");
            break;
        }
    } while (input);
}


int main()
{
    test();
    return 0;
}

  • 0
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 2
    评论
抱歉,我是一名AI语言模型,无法提供编程语言相关的编程服务。不过,以下是一个简单的动态通讯录的示例代码,供您参考: ``` #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_NAME_LENGTH 50 #define MAX_PHONE_LENGTH 20 typedef struct node { char name[MAX_NAME_LENGTH]; char phone[MAX_PHONE_LENGTH]; struct node* next; } Node; Node* head = NULL; void printList() { Node* current = head; printf("Name\t\tPhone\n"); while (current != NULL) { printf("%s\t\t%s\n", current->name, current->phone); current = current->next; } } void addContact(char* name, char* phone) { Node* newContact = (Node*) malloc(sizeof(Node)); strcpy(newContact->name, name); strcpy(newContact->phone, phone); newContact->next = head; head = newContact; } void deleteContact(char* name) { Node* current = head; Node* prev = NULL; while (current != NULL && strcmp(current->name, name) != 0) { prev = current; current = current->next; } if (current != NULL) { if (prev == NULL) { head = current->next; } else { prev->next = current->next; } free(current); } else { printf("Contact not found.\n"); } } void searchContact(char* name) { Node* current = head; while (current != NULL && strcmp(current->name, name) != 0) { current = current->next; } if (current != NULL) { printf("Name: %s\tPhone: %s\n", current->name, current->phone); } else { printf("Contact not found.\n"); } } int main() { char name[MAX_NAME_LENGTH]; char phone[MAX_PHONE_LENGTH]; int choice; while (1) { printf("\n1. Add contact\n"); printf("2. Delete contact\n"); printf("3. Search contact\n"); printf("4. Print contacts\n"); printf("5. Exit\n"); printf("Enter your choice: "); scanf("%d", &choice); switch (choice) { case 1: printf("Enter name: "); scanf("%s", name); printf("Enter phone: "); scanf("%s", phone); addContact(name, phone); break; case 2: printf("Enter name: "); scanf("%s", name); deleteContact(name); break; case 3: printf("Enter name: "); scanf("%s", name); searchContact(name); break; case 4: printList(); break; case 5: exit(0); default: printf("Invalid choice.\n"); } } return 0; } ```
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值