linuxC通訊錄

2019-11-08 03:16:24

字體：大中小

供稿：網(wǎng)友

/*****************************************************copyright (C), Nanjing University of TecnologyFile name：list.cAuthor: Zhangchao Version:0.1 Date: 2016-12-13 16:28Description：Funcion List: *****************************************************/#include <stdio.h>#include <stdlib.h>#include <string.h>struct list{ char name[30]; char sex[30]; char birth[30]; char phone[30]; char job[30]; char email[30]; struct list *next;};typedef struct list List;typedef struct list *Link;void creat_new_node(Link *new_node);void creat_link(Link *head) //創(chuàng)建鏈表{ creat_new_node(head); (*head)->next = NULL;}void creat_new_node(Link *new_node) //創(chuàng)建結(jié)點(diǎn){ *new_node = (Link)malloc(sizeof(List)); //分配空間 if(*new_node == NULL) { PRintf("malloc error/n"); exit(-1); } }void creat_new_node(Link *new_node);void add_new_node(Link *head) //添加聯(lián)系人功能{ Link new_node; //創(chuàng)建新結(jié)點(diǎn)插入 creat_new_node(head); printf("請(qǐng)輸入姓名:"); scanf("%s",(new_node)->name); printf("請(qǐng)輸入性別:"); scanf("%s",(new_node)->sex); printf("請(qǐng)輸入生日:"); scanf("%s",(new_node)->birth); printf("請(qǐng)輸入電話:"); scanf("%s",(new_node)->phone); printf("請(qǐng)輸入職業(yè):"); scanf("%s",(new_node)->job); printf("請(qǐng)輸入郵箱:"); scanf("%s",(new_node)->email); printf("添加完成/n"); insert_node(head,new_node); }insert_node(Link head,Link new_node) //前插{ (new_node)->next = head->next; head->next = new_node;}void menu_select() //菜單顯示{ printf("**************歡迎使用通訊錄**************/n"); printf("************請(qǐng)選擇要使用的功能************/n"); printf(" 1.添加聯(lián)系人 /n"); printf(" 2.查找聯(lián)系人 /n"); printf(" 3.刪除聯(lián)系人 /n"); printf(" 4.顯示通訊錄 /n"); printf(" 5.清空通訊錄 /n"); printf(" 6.退出通訊錄 /n"); printf("******************************************/n"); printf("******************************************/n");}void switch_func(Link *head) //功能選擇{ int num; scanf("%d",&num); switch(num) { case 1:add_new_node(head);break; case 2:find_node(head);break; case 3:delete_node(head);break; // case 4:display_link(head);break; // case 5:release_link(head);break; // case 6:exit_link();break; default:printf("功能不存在，請(qǐng)重新輸入對(duì)應(yīng)編號(hào)!");break; }}find_node(Link head) //查找聯(lián)系人功能{ char name[30]; Link p = head->next; printf("請(qǐng)輸入您要查找的聯(lián)系人姓名:"); scanf("%s",name); if(p->next == NULL) { printf("通訊錄是空的"); return; } else { while(strcmp(p->name,name) != 0 && p->next != NULL) { p=p->next; } if(p->next == NULL) { if(strcmp(p->name,name) !=0) { printf("查無(wú)此人"); } else { printf("%s/n",p->name); printf("%s/n",p->sex); printf("%s/n",p->birth); printf("%s/n",p->phone); printf("%s/n",p->job); printf("%s/n",p->email); } } else { printf("%s/n",p->name); printf("%s/n",p->sex); printf("%s/n",p->birth); printf("%s/n",p->phone); printf("%s/n",p->job); printf("%s/n",p->email); } }}delete_node(Link head) //刪除聯(lián)系人{(lán) char name[30]; Link p1,p2; p1 = head->next; p2 = head; printf("請(qǐng)輸入要?jiǎng)h除的聯(lián)系人姓名:"); scanf("%s",name); if(head->next == NULL) { printf("通訊錄為空"); return; } while(strcmp(p1->name,name) != 0 && p1->next !=NULL) { p2 = p1; p1 = p1->next; } p2->next = p1->next; free(p1);}int main(int argc, char **argv) //主函數(shù){ Link head = NULL; Link new_node = NULL; creat_link(&head); while(1) { menu_select(); switch_func(&head); } return 0;}

上一篇：圖的連通性問(wèn)題

下一篇：Elastic-job的簡(jiǎn)單使用