简单通讯录

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


#define len sizeof(struct tongxunlu)
#define error 0


struct tongxunlu
{
char name[20];
int tel;
char addr[20];
struct tongxunlu *next;
};


typedef struct tongxunlu txl;
txl *init();
txl *create_tail(txl *head, int n);
txl *insert(txl *head, txl *indata, int n);
txl *delete(txl *head, int n);
txl *revise(txl *head, char a[20]);
txl *find(txl *head,  char a[20]);
txl *sort(txl *head);
txl *print(txl *head);
void caidan();


int main()
{
txl *head, *indata;
int n, m, k, key;
char a[20];
char b[20];


head=init(head);
print(head);
printf(" 0 Back to the main menu \n");
printf("1 create txl 2 insert lxr\n");
printf("3 delete lxr 4 revise lxr\n");
printf("5 find   lxr 6 sort   lxr\n");
while(1)
{
printf("By entering the number to go to the service you need.\n");
scanf("%d",&key);


switch(key)
{
case 0: caidan(); break;

case 1:
// head=init(head);
// print(head);
printf("input the num of lianbiao\n");
scanf("%d",&n);
head=create_tail(head,n);
print(head);
break;


case 2:
indata=(txl *)malloc(len);
printf("the site you want's insert\n");
scanf("%d",&m);
printf("cha ru de shuju\n");
scanf("%s%d%s",indata->name,&indata->tel,indata->addr);
head=insert(head,indata,m);
print(head);
                    break; 


case 3:
printf("the num you want delete\n");
scanf("%d",&k);
head=delete(head,k);
print(head);
break;


case 4:
printf("the name you want revise\n");
scanf("%s",&a);
head=revise(head,a);
print(head);
break;


case 5:
printf("the name you want find\n");
scanf("%s",&b);
find(head,b);
break;


case 6:
printf("please sort you txl\n");
head=sort(head);
print(head);
break;
default:
break;
}
}


/*
head=init(head);
print(head);
printf("input the num of lianbiao\n");
scanf("%d",&n);
head=create_tail(head,n);
print(head);


indata=(txl *)malloc(len);
printf("the site you want's insert\n");
scanf("%d",&m);
printf("cha ru de shuju\n");
scanf("%s%d%s",indata->name,&indata->tel,indata->addr);
head=insert(head,indata,m);
print(head);

printf("the num you want delete\n");
scanf("%d",&k);
head=delete(head,k);
print(head);

printf("the name you want revise\n");
scanf("%s",&a);
head=revise(head,a);
print(head);


printf("the name you want find\n");
scanf("%s",&b);
find(head,b);


printf("please sort you txl\n");
head=sort(head);
print(head); 


*/
return 0;
}


void caidan()
{


printf(" 0 Back to the main menu \n");
printf("1 create txl 2 insert lxr\n");
printf("3 delete lxr 4 revise lxr\n");
printf("5 find   lxr 6 sort   lxr\n");


}




txl *init()
{
txl *head;

head=(txl *)malloc(len);
if(head==NULL)
return error;
head->next=NULL;
printf("111\n");

return head;
}


txl *create_tail(txl *head, int n)
{
int i;
txl *pre, *after;
head=(txl *)malloc(len);
pre=head;
after=head;


for(i=0; i<n; i++)
{
pre=(txl *)malloc(len);
scanf("%s%d%s",pre->name,&pre->tel,pre->addr);
after->next=pre;
after=pre;
}
pre->next=NULL;


return head;
}




txl *insert(txl *head, txl *indata, int n)
{
txl *look;
int count=0;


if(0==n)
{
indata->next=head->next;
head->next=indata;
}


else
{
look=head;
while((count<n)&&(look!=NULL))
{
count++;
look=look->next;
}
if(count==n)
{
indata->next=look->next;
look->next=indata;
}
if(indata==NULL)
        {
            printf("out of range\n");
        }
}

return head;
}

txl *delete(txl *head, int n)
{
txl *look, *q;
int count=0;

look=head;
while((count<n-1)&&(look!=NULL))
{
count++;
look=look->next;
}
if(count==n-1)
{
q=look->next;
look->next=q->next;
free(q);
}
// if(look->next== NULL)
// return error;


return head;
}


txl *revise(txl *head, char a[20])
{
txl *look;

look=head;
while(look!=NULL)
{
if(strcmp(look->name,a)==0)
{
printf("input the tel you want revise\n");
scanf("%s%d%s",look->name,&look->tel,look->addr);
break;
}
look=look->next;
}


return head;
}


txl *find(txl *head,  char a[20])
{
txl *look;

look=head;
while(look!=NULL)
{
if(strcmp(look->name,a)==0)
{
printf("name: %s   tel: %d   addr:    %s\n",look->name,look->tel,look->addr);
break;
}
look=look->next;
}


return head;
}


txl *sort(txl *head)
{
txl *look, *p;
int count=0, n, i, j;
char a[20];
int b[20];


look=head;
while(look!=NULL)
{
count++;
look=look->next;
}
n=count-1;
// printf("%d\n",n);
p=head->next;
for(j=0; j<n-1; j++)
{
p=head->next;
for(i=0; i<n-j-1; i++)
{
if(strcmp(p->name,p->next->name)>0)
{
strcpy(a,p->name);
strcpy(p->name,p->next->name);
strcpy(p->next->name,a);


b[20]=p->tel;
p->tel=p->next->tel;
p->next->tel=b[20];


strcpy(a,p->addr);
strcpy(p->addr,p->next->addr);
strcpy(p->next->addr,a);
}
p=p->next;
}
}
return head;
}


txl *print(txl *head)
{
txl *pre;
pre=head->next;


if(pre==NULL)
printf("this is a empty\n");
while(pre!=NULL)
{
printf("name: %s   tel: %d   addr:    %s\n",pre->name,pre->tel,pre->addr);
pre=pre->next;
}
printf("\n");
return head;
}