#include <stdio.h>
#include <string.h>
#include <stdlib.h> /* For system("CLS") and itoa */
#define VISUAL_C
/*#define TURBO_C*/
#ifdef VISUAL_C
#include <malloc.h>
#define DISPLAY "1. 显示全部组员信息.\n"
#define INSERT "2. 插入一个组员.\n"
#define DELETE "3. 删除一个组员.\n"
#define UPDATE "4. 更新组员信息.\n"
#define INVERT "5. 反转组员链表.\n"
#define SEARCH "6. 搜索符合指定条件的组员.\n"
#define RANGE "7. 按指定条件排序全部组员.\n"
#define CLRSCR "8. 清屏.\n"
#define EXIT "0. 退出.\n"
#else
#include <alloc.h>
#define DISPLAY "1. Display all member information.\n"
#define INSERT "2. Insert a new member.\n"
#define DELETE "3. Delete a member.\n"
#define UPDATE "4. Update member information.\n"
#define INVERT "5. Invert member linklist.\n"
#define SEARCH "6. Search member accord with condition.\n"
#define RANGE "7. Range member accord with condition.\n"
#define CLRSCR "8. Clear screen.\n"
#define EXIT "0. Exit.\n"
#endif
#define DATAFILENAME "data.txt"
#define LINELENGTH 30
typedef struct node
{
void *info;
struct node *link;
}NODE;
typedef struct member
{
int num; /* 学号 number */
char name[12]; /* 姓名 name */
char sex[2]; /* 性别 sex */
int age; /* 年龄 age */
int score; /* 成绩 score */
}MEMBER; /* 定义成员属性 define member attribute*/
print_llist(NODE *h) /* 输出链表 ouput linklist */
{
NODE *p;
MEMBER *mb;
#ifdef VISUAL_C
printf(" 学号 姓名 性别 年龄 成绩\n");
#else
printf(" num name sex age score\n");
#endif
p = h->link;
while (p!=NULL)
{
mb = (MEMBER*)p->info;
printf( "%5d %8s %4s %5d %6d\n",
mb->num, mb->name, mb->sex, mb->age, mb->score);
p = p->link;
}
printf("\n");
}
/*
int length(NODE *h)
{
int i = 0;
NODE *p;
p = h;
while (p->link != NULL)
{
p = p->link;
i++;
}
return i;
}
*/
insert_llist(NODE *h, int i)
{
NODE *p,*q;
MEMBER *mb;
p = h;
for ( ; i > 0; i--)
p = p->link;
q = (NODE*)malloc(sizeof(NODE));
mb = (MEMBER*)malloc(sizeof(MEMBER));
printf("请输入新组员的学号:"); scanf("%d", &mb->num);
printf("请输入新组员的姓名:"); scanf("%s", mb->name);
printf("请输入新组员的性别:"); scanf("%s", mb->sex);
printf("请输入新组员的年龄:"); scanf("%d", &mb->age);
printf("请输入新组员的成绩:"); scanf("%d", &mb->score);
q->info = (void*)mb;
q->link = p->link;
p->link = q;
}
NODE *del_llist(NODE *h, int i)
{
NODE *p,*q;
MEMBER *mb;
p = h;
for ( ; i > 1; i--)
p = p->link;
q = p->link;
p->link = q->link;
mb = (MEMBER*)q->info;
free(mb);
free(q);
return h;
}
update_llist(NODE *h, int i)
{
NODE *p;
MEMBER *mb;
p = h;
for ( ; i > 0; i--)
p = p->link;
mb = (MEMBER*)p->info;
printf( "%5d %8s %4s %5d %6d\n",
mb->num, mb->name, mb->sex, mb->age, mb->score);
printf("请输入该组员的学号:"); scanf("%d", &mb->num);
printf("请输入该组员的姓名:"); scanf("%s", mb->name);
printf("请输入该组员的性别:"); scanf("%s", mb->sex);
printf("请输入该组员的年龄:"); scanf("%d", &mb->age);
printf("请输入该组员的成绩:"); scanf("%d", &mb->score);
p->info = (void*)mb;
}
NODE *invert(NODE *h) /* 反转链表 invert linklist */
{
NODE *p,*ht;
ht = h->link; /* 用指针指向头结点后的第一个结点，以防断链 */
h->link = NULL; /* 置链表为空表 */
while (ht != NULL)
{
p = ht; /* 将原链表中的结点依次插入到新链 */
ht = ht->link;
p->link = h->link;
h->link = p;
}
return h;
}
search_llist(NODE *h, char *condition)
{
NODE *p;
MEMBER *mb;
char str[30];
p = h->link;
while (p != NULL)
{
mb = (MEMBER*)p->info;
if (0 == strcmp(condition, itoa(mb->num, str, 10)))
printf( "%5d %8s %4s %5d %6d\n",
mb->num, mb->name, mb->sex, mb->age, mb->score);
p = p->link;
}
}
/* 算法: 交换排序法 arithmetic: change */
/* 描述: 每次用当前的结点一一的同其后的结点比较并交换 */
/* 特点: 最清晰简单 */
NODE *range_llist(NODE *h, int i)
{
NODE *p,*q;
void *v;
MEMBER *mb1,*mb2;
char s1[30];
char s2[30];
for (p = h->link; p->link; p = p->link )
{
for (q = p->link; q; q = q->link)
{
mb1 = (MEMBER*)p->info;
mb2 = (MEMBER*)q->info;
switch(i)
{
case 1:{strcpy(s1, itoa(mb1->num, s1, 10));
strcpy(s2, itoa(mb2->num, s2, 10));break;}
case 2:{strcpy(s1, mb1->name);
strcpy(s2, mb2->name);break;}
case 3:{strcpy(s1, mb1->sex);
strcpy(s2, mb2->sex);break;}
case 4:{strcpy(s1, itoa(mb1->age, s1, 10));
strcpy(s2, itoa(mb2->age, s2, 10));break;}
case 5:{strcpy(s1, itoa(mb1->score, s1, 10));
strcpy(s2, itoa(mb2->score, s2, 10));break;}
}
if (strcmp(s1, s2) > 0)
{
v = q->info;
q->info = p->info;
p->info = v;
}
} /* End of for */
} /* End of for */
return h;
}
NODE *ReadData(FILE *fp, int *len)
{
NODE *h,*p;
MEMBER *mb;
char line[LINELENGTH];
h = (NODE *)malloc(sizeof(NODE)); /* 生成头结点 create head node */
if (NULL == h) return NULL;
h->info = (void*)len;
h->link = NULL;
/* 建立链表 create linklist */
while (fgets( line, LINELENGTH, fp) != NULL)
{
mb = (MEMBER*)malloc(sizeof(MEMBER));
sscanf( line, "%d|%[^'|']|%[^'|']|%d|%d|",
&mb->num, mb->name, mb->sex, &mb->age, &mb->score );
p = (NODE*)malloc(sizeof(NODE));
p->info = (void*)mb;
p->link = h->link;
h->link = p;
(*(int*)h->info)++;
}
return invert(h);
}
int WriteData(NODE* h, FILE *fp)
{
NODE *p;
MEMBER *mb;
char line[LINELENGTH];
p = h->link;
while (p)
{
mb = (MEMBER*)p->info;
sprintf( line, "%d|%s|%s|%d|%d|\r\n",
mb->num, mb->name, mb->sex, mb->age, mb->score);
fputs(line, fp);
p = p->link;
}
return 1;
}
void main()
{
NODE *head;
int count = 0; /* 结点个数(表长) node number(list length) */
FILE *fp = 0; /* 文件句柄 file handle */
int sel,pos;
char condition[30];
if ((fp = fopen(DATAFILENAME, "r+")) == NULL)
{
printf("cannot open this file!\n");
return;
}
head = ReadData(fp, &count);
fclose(fp);
if (NULL == head) return;
while (1) /* 设置菜单 Setting menu */
{
printf(DISPLAY);
printf(INSERT);
printf(DELETE);
printf(UPDATE);
printf(INVERT);
printf(SEARCH);
printf(RANGE);
printf(CLRSCR);
printf(EXIT);
printf("please input a number:");
scanf("%d", &sel);
switch(sel)
{
case 1:
{ /* Print */
print_llist(head);
break;
}
case 2:
{ /* Insert */
printf("Please input position:");
scanf("%d",&pos); /* head:0 first node:1 ... */
if (pos < 0 || pos > count) break;
insert_llist(head, pos);
count++;
print_llist(head);
break;
}
case 3:
{ /* Delete */
printf("Please input position:");
scanf("%d",&pos); /* first node:1 ... */
if (pos < 1 || pos > count) break;
del_llist(head, pos);
count--;
print_llist(head);
break;
}
case 4:
{ /* Update */
printf("Please input position:");
scanf("%d",&pos); /* first node:1 ... */
if (pos < 1 || pos > count) break;
update_llist(head, pos);
print_llist(head);
break;
}
case 5:
{ /* Invert */
head = invert(head);
print_llist(head);
break;
}
case 6:
{ /* Search */
printf("Please input the member number:");
scanf("%s", &condition);
search_llist(head, condition);
break;
}
case 7:
{ /* Range */
#ifdef VISUAL_C
printf("(1:学号 2.姓名 3.性别 4.年龄 5.成绩) Please input a choose:");
#else
printf("(1:Number 2.Name 3.Sex 4.Age 5.Score) Please input a choose:");
#endif
scanf("%d",&pos);
if (pos < 1 || pos > 5) break;
head = range_llist(head, pos);
print_llist(head);
break;
}
case 8:
{
#ifdef VISUAL_C
system("CLS");
#else
clrscr();
#endif
break;
}
case 0: break;
default: break;
} /* End of switch */
if (0 == sel)
break;
printf("Press ENTER to continue..");
setbuf(stdin, NULL);
getchar();
} /* End of while */
/* Save to file */
fp = fopen(DATAFILENAME, "w");
WriteData(head, fp);
fclose(fp);
free(head);
}
