通讯录——》用文件保存结构的节点的数据

1. 出现段错误时候怎么查找错误
   gcc test.c -o test -g -rdynamic

2. 两三个c 文件一起编译时候怎么写

gcc test.c hello.c -o test -g -rdynamic

3. gdb test

4. r(run)

#ifnedf linklisth
#define linklisth

头文件
#define success 1000
#define failure 1001
#define true 1002
#define false 1003
#define hahahaha 1004

typedef int elemtype;

struct node
{
char data1[20];
char data2[20];
char data3[20];
char data4[20];
struct node *next；
};

typedef struct node node;
typedef node * pnode;

int initlinklist(pnode *l);
int deletelink(pnode l, int p);
int insertlink(pnode l);
int show(pnode l);
int locateelem(pnode l);
int locate(pnode l);

#endif

主函数

#define “linklist.h”
#include <stdio.h>
#include<stdlib.h>
#include<sys/types.h>
#include<sys/stat.h>
#include<fcntl.h>
#include<string.h>

int main()
{
FILE *fp;
pnode first;
int ret;
int k = 3;
initlinklist(&first);
fp = fopen(“haha.txt”, “rw+”);
if(NULL == fp)
{
perror(“fopen”);
exit(1);
}
pnode p = (pnode)malloc(sizeof(node)*1);
while(0 != fread(p, sizeof(node), 1, fp))
{
add(first, p);

}
free§;
fclose(fp);

system(“clear”);
int choice;

welcome();
while(1)
{
kkk();
scanf("%d", &choice);
switch(choice)
{
case 0:
read(first);
break;
case 1:
insertlink(first);
break;
case 2:
show(first);
break;
case 3:
locateelem(first);
break;
case 4:
ret = locate(first);
if(hahahaha == ret)
{
break;
}
deletelink(first, ret);
break;
case 5：
system(“clear”);
printf(“BUY!\n”);
exit(1);
break;
case 6:
fp = fopen(“haha.txt”, “wt+”);
if(NULL == fp)
{
perror(“fopen”);
exit(1);
}
pnode p = first->next;
while(NULL != p)
{
fwrite(p, sizeof(node));
p = p->next;
}
fclose(fp);
break;

}
}
return 0;

}

函数库

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

void welcome()
{
printf("\033[47;33;1m WELCOME
\033[0m\n ");
sleep(2);
}

void kkk()
{
system(“clear”);
printf(" 主目录\n");
printf("\t\t1. 添加信息 2. 显示信息\n");
printf("\t\t 3. 查找信息 4. 删除信息\n);
printf("\t\t 5. 退出\n");

}

int initlinklist(pnode *l)
{
(*l) = (pnode)malloc(sizeof(node)*1);
if(NULL == *l)
{
return failure;
}
(*l)->next = NULL;
return success;
}

int insertlink(pnode l)
{
pnode q = l;
int k = 1;
int result;

if(NULL == l)
{
printf(“没有通讯录请创建通讯录\n”);
}

pnode n = (pnode)malloc(sizeof(node)*1);
printf(“请输入名字、电话、年龄、学号：\n”);
scanf("%s %s %s %s ", n->data1, n->data2, n->data3, n->data4);
n->next = q->next;
q->next = n;
q = q->next;
q = q->next;
qkq:

while(11 != strlen(n->data2))
{
printf(“号码不是十一位请从新输入 ：\n”);
scanf("%s", n->data2);
}

while(q != NULL)
{
result = strcmp(n->data2, q->data2);
if(result == 0)
{
printf(“号码已经存在请从新输入号码 ：\n”);
scanf("%s", n->data2);
goto qkq;
}
q = q->next;
}
printf(“录入成功\n”);
sleep(2);
getchar ();
getchar();

}

int show(pnode l)
{
if(NULL＝＝　ｌ)
printf(“没有通讯录请创建通讯录\n”);

}
if(NULL == l->next)
{
printf(“通讯录里没有联系人请添加联系人\n”);
}
char a[20];
char b[20];
char c[20];
char d[20];
pnode k1 = 1;
pnode k2 = 1;

k1 = k1->next;
for(k1; k1 !=NULL ; k1 = k1->next)
{
for(k2 = k1->next; k2 != NULL ; k2 = k2->next)
if(strcmp(k1->data1, k2->data1) >0)
{
strcpy(a, k2->data1);
strcpy(k2->data1, k1->data1);
strcpy(k1->data1, a);

strcpy(b, k2->data2);
strcpy(k2->data2, k1->data2);
strcpy(k1->data2, b);

strcpy(c, k2->data3);
strcpy(k2->data3, k1->data3);
strcpy(k1->data3, c);

strcpy(d, k2->data4);
strcpy(k2->data4, k1->data4);
strcpy(k1->data4, d);

}
}

pnode p = 1;
p = l->next;
while(p != NULL)
{
printf("%s %s %s %s \n", p->data1, p->data2, p->data3, p->data4);
p = p->next;
}
printf(“enter one number to continue:\n”);
getchar();
getchar();
}

int locateelem(pnode l)
{
if(NULL == 1)
{
printf(“没有通讯录请创建通讯录\n);
}
char e[20];
printf(“请输入要搜索的名字 ：\n”);
scanf(”%s", e);
if(NULL == l)
{
return failure;
}
pnode n = l->next;

while(n)
{
if(strcmp(n->data1, e) == 0)
{
printf("%s %s %s %s\n", n->data1, n->data2, n->data3, n->data4);
goto hahaha;
}
n = n->next;
}
sleep(1);
if(NULL == n)
{
printf(“未找到这个人！\n”);
}　
hahaha:
printf(“enter one number to continue:\n”);
getchar();
getchar();
}

int locate(pnode l)
{
if(NULL == l)
{
printf(“没有通讯录请创建通讯录\n”);
}
int len = 1;
char t[20];
if(NULL == l)
{
return failure;
}
printf(“请输入你想删除的人的名字：\n”);
scanf("%s", t);
pnode k = l->next;
while(k != NULL)
{
if(strcmp(k->data1, t) == 0)
{
return len;
}
k = k->next;
len++；

}
sleep（1）;
if( k == NULL)
{
printf(“通讯录里没有这个人!\n”);
}
sleep(2);
printf(“please enter one number to continue:\n”);
getchar();
getchar();
return hahahaha;

}

int deletelink(pnode l, int p)
{
pnode q = l;
int k = 1;

while(k < p)
{
q = q->next;
k++;
}
pnode n = q->next;
q->next = n->next;
free(n);
prrintf(“删除成功 ！\n”);
printf(“enter one number to continue:\n”);
sleep(2);
getchar();
getchar();

}

int add(pnode l, pnode q)
{
if(NULL == l || NULL == q)
{

return failure;
}
pnode k = (pnode)malloc(sizeof(node)*1);
if(NULL == k)
{
return failure;
}
strcpy(k->data1, q->data1);
strcpy(k->data2, q->data2);
strcpy(k->data3, q->data3);
strcpy(k->data4, q->data4);

k->next = l->next;
l->next = k;
}