16 · 综合项目：简易通讯录

#define MAXN 5
#define NAME_LEN 20
#define TEL_LEN 20

typedef struct
{
    char name[NAME_LEN];
    char tel[TEL_LEN];
} Person;

Person book[MAXN];
int count = 0;

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

#define MAXN 5

typedef struct
{
    char name[20];
    char tel[20];
} Person;

Person book[MAXN];
int count = 0;

void add_person(void)
{
    if (count >= MAXN)
    {
        printf("通讯录已满\n");
        return;
    }
    printf("姓名: ");
    scanf("%19s", book[count].name);
    printf("电话: ");
    scanf("%19s", book[count].tel);
    count++;
    printf("已添加\n");
}

void list_all(void)
{
    int i;
    if (count == 0)
    {
        printf("空\n");
        return;
    }
    for (i = 0; i < count; i++)
    {
        printf("%d. %s  %s\n", i + 1, book[i].name, book[i].tel);
    }
}

void find_one(void)
{
    char key[20];
    int i;
    printf("查找姓名: ");
    scanf("%19s", key);
    for (i = 0; i < count; i++)
    {
        if (strcmp(book[i].name, key) == 0)
        {
            printf("电话: %s\n", book[i].tel);
            return;
        }
    }
    printf("没找到\n");
}

int main(void)
{
    int cmd;
    for (;;)
    {
        printf("1添加 2列表 3查找 0退出\n");
        if (scanf("%d", &cmd) != 1) break;
        if (cmd == 0) break;
        if (cmd == 1) add_person();
        else if (cmd == 2) list_all();
        else if (cmd == 3) find_one();
        else printf("无效\n");
    }
    return 0;
}