数据结构项目一之电子通讯录（单链表-文件）（改一）

#include <stdio.h> #include <stdlib.h> #include "LinkList.h" #include <string.h> #include "error.h" extern int id_count; //创建链表 LinkList *Create_List() { LinkList *head = (LinkList *)malloc(sizeof(LinkList)/sizeof(char)); if (head == NULL) { errno = MALLOC_ERROR; return NULL; } head -> next = NULL; return head; } //尾插法 int Insert_Last(LinkList *h,LinkData data) { if (h == NULL) { errno = ERROR; return FALSE; } LinkList *tmp = h; LinkList * node = (LinkList *)malloc(sizeof(LinkList)/sizeof(char)); if (node == NULL) { errno = MALLOC_ERROR; return FALSE; } node -> data = data; node -> next = NULL; while (tmp -> next) { tmp = tmp -> next; } tmp -> next = node; id_count++; return TRUE; } // 删除指定姓名的节点 int Delete_Data(LinkList *h, char *name) { if(h == NULL || name == NULL) { errno = ERROR; return FALSE; } int count = 0; LinkList *tmp = h; LinkList *p = NULL; while (tmp -> next) { if (strcmp(tmp -> next -> data.name,name) == 0) { p = tmp -> next; count++; } tmp = tmp -> next; } if (count == 0) { return FALSE; } else if(count == 1) { tmp = h; while (tmp -> next) { if (strcmp(tmp -> next -> data.name,name) == 0) { p = tmp -> next; tmp -> next = p -> next; free (p); return TRUE; } tmp = tmp -> next; } } else { Find_Element(h,name); printf ("\t\t有一个以上同名，请输入ID号："); int id; scanf ("%d",&id); if (Delete_ID(h,name,id) == 0) { printf ("\t\t找不到这个ID\n"); return FALSE; } return TRUE; } } //删除指定姓名和ID号的节点 int Delete_ID(LinkList *h, char *name, int ID) { if(h == NULL || name == NULL) { errno = ERROR; return FALSE; } LinkList *tmp = h; while (tmp -> next) { if (strcmp(tmp -> next -> data.name,name) == 0 && tmp -> next -> data.id == ID) { LinkList *p = tmp -> next; tmp -> next = p -> next; free (p); return TRUE; } tmp = tmp -> next; } return FALSE; } // 查找元素:如果有, 输出 int Find_Element(LinkList* h, char *name) { if(h == NULL || name == NULL) { errno = ERROR; return FALSE; } LinkList *tmp = h -> next; int count = 0; while (tmp) { if (strcmp(tmp -> data.name,name) == 0) { count++; printf ("\t\tid = %04d name = %-10s phone_tel = %-11s address = %-10s company_tel = %-11s\n",tmp->data.id,tmp->data.name,tmp->data.phone_tel,tmp->data.address,tmp->data.company_tel); } tmp = tmp -> next; } if (count) { return TRUE; } return FALSE; } //获取链表长度 int Get_Len(LinkList *h,int *len) { if(h == NULL || len == NULL) { errno = ERROR; return FALSE; } int count = 0; LinkList *tmp = h; while(tmp -> next) { tmp = tmp -> next; count++; } *len = count; return TRUE; } //链表排序 int Order_List(LinkList *h) { if(h == NULL) { errno = ERROR; return FALSE; } if(h -> next == NULL) { errno = EMPTY_LINKLIST; printf ("\t\t通讯录为空\n"); return TRUE; } int len; Get_Len(h,&len); LinkList * tmp = (LinkList *)malloc(sizeof(LinkList)/sizeof(char)); if (tmp == NULL) { errno = MALLOC_ERROR; return FALSE; } int i,j; for (i = 1;i < len;i++) { LinkList* min = h -> next; LinkList* max = h -> next -> next; for (j = 1;j < len - i + 1;j++) { if (min -> data.id > max -> data.id) { tmp -> data = min -> data; min -> data = max -> data; max -> data = tmp -> data; } min = min -> next; max = max -> next; } } free (tmp); return TRUE; } //打印链表 int Display(LinkList *h) { if (h == NULL) { errno = ERROR; printf ("\t\t没有头节点\n"); return FALSE; } LinkList *tmp = h -> next; while(tmp) { printf ("\t\tid = %04d name = %-10s phone_tel = %-11s address = %-10s company_tel = %-11s\n",tmp->data.id,tmp->data.name,tmp->data.phone_tel,tmp->data.address,tmp->data.company_tel); tmp = tmp -> next; } return TRUE; } //删除第Pos个节点，从1开始，没有第0个节点，头节点不算 int Delete_Pos(LinkList *h,int Pos) { if (h == NULL || Pos < 1) { errno = ERROR; return FALSE; } int i; LinkList *tmp = h; for (i = 0;i < Pos -1;i++) { tmp = tmp -> next; if(tmp -> next == NULL) { errno = OVER_DELETE; printf ("删除位置越界\n"); return FALSE; } } LinkList *p = tmp -> next; tmp -> next = p -> next; free (p); return TRUE; } // 清空所有结点 int Clean_List(LinkList *h) { if(h == NULL) { errno = ERROR; return FALSE; } LinkList *tmp = h; while (tmp -> next) { Delete_Pos(h,1); } return TRUE; } // 销毁链表 int Destroy(LinkList *h) { if(h == NULL) { errno = ERROR; return FALSE; } Clean_List(h); free (h); return TRUE; } //获取插入的值 int Get_Data(LinkData *data) { printf ("\t\t请输入数据：\n"); data ->id = id_count; printf ("\t\t请输入姓名（英文）："); scanf ("%10s",data -> name); printf ("\t\t请输入手机号码 ："); scanf ("%11s",data -> phone_tel); printf ("\t\t请输入家庭住址 ："); scanf ("%10s",data -> address); printf ("\t\t请输入公司电话 ："); scanf ("%11s",data -> company_tel); //printf ("\n"); }