#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAX 100
#define TRUE 1
#define FALSE 0
#define Status int
typedef struct node
{
char name[12];
char addr[40];
char mphone[12];
char tel[14];
char sex;
unsigned char age;
}DataType
typedef struct
{
DataType Element[MAX];
int length;
}Slist;
char *menu_1[] = {
"***********************\n",
"1.增加记录\n",
"2.删除记录\n",
"3.修改记录\n",
"4.查询记录\n",
"0.退出\n",
"***********************\n"
};
char *menu_query1[] = {
"***********************\n",
"1.按姓名查询\n",
"2.按手机号码查询\n",
"3.全部输出\n",
"0.退出\n",
"***********************\n"
"***********************\n",
"1.按姓名删除\n",
"2.按手机号码删除\n",
"0.退出\n",
"***********************\n"
};
char menu(char *str[],int len)
{
char sel;
int i;
for (i=0 ; i<len; i++)
{
printf("%s",str[i]);
}
printf("请输入您的选择:");
scanf(" %c",&sel);
getchar();
return sel;
}
Status InitList(Slist *L)
{
L->length = 0;
return TRUE;
}
int ListLength(Slist L)
{
return L.length;
}
Status ListEmpty(Slist L)
{
if ( 0 == L.length)
{
return TRUE;
}
else
{
return FALSE;
}
}
Status ListInsert(Slist *L,int i,DataType e)
{
int j;
if ( MAX == L
#include <string.h>
#include <stdlib.h>
#define MAX 100
#define TRUE 1
#define FALSE 0
#define Status int
typedef struct node
{
char name[12];
char addr[40];
char mphone[12];
char tel[14];
char sex;
unsigned char age;
}DataType
typedef struct
{
DataType Element[MAX];
int length;
}Slist;
char *menu_1[] = {
"***********************\n",
"1.增加记录\n",
"2.删除记录\n",
"3.修改记录\n",
"4.查询记录\n",
"0.退出\n",
"***********************\n"
};
char *menu_query1[] = {
"***********************\n",
"1.按姓名查询\n",
"2.按手机号码查询\n",
"3.全部输出\n",
"0.退出\n",
"***********************\n"
};
char *menu_query2[] = {
"***********************\n",
"1.按姓名修改\n",
"2.按手机号码修改\n",
"0.退出\n",
"***********************\n"
};
"***********************\n",
"1.按姓名删除\n",
"2.按手机号码删除\n",
"0.退出\n",
"***********************\n"
};
char menu(char *str[],int len)
{
char sel;
int i;
for (i=0 ; i<len; i++)
{
printf("%s",str[i]);
}
printf("请输入您的选择:");
scanf(" %c",&sel);
getchar();
return sel;
}
Status InitList(Slist *L)
{
L->length = 0;
return TRUE;
}
int ListLength(Slist L)
{
return L.length;
}
Status ListEmpty(Slist L)
{
if ( 0 == L.length)
{
return TRUE;
}
else
{
return FALSE;
}
}
Status ListInsert(Slist *L,int i,DataType e)
{
int j;
if ( MAX == L

该程序展示了如何利用线性表数据结构来创建一个简单的通讯录应用。用户可以按姓名或手机号码进行信息修改。通过输入选择项,用户可以选择按姓名查找并更新联系人,或者按手机号码查询联系人详情。如果输入不存在,则会提示相应的错误信息。
最低0.47元/天 解锁文章
6912

被折叠的 条评论
为什么被折叠?



