宿舍管理系统链表C语言C数据结构链表课程设计.docxVIP

#include stdio.h ★include stdlib. h #inelude string. h ^include conio. h /*采用双向链表结构，方便添加删除和排序*/ typedef struct node{ /* 定义结构体类型 dnode */ long id; /*楼号和房间号，因为一个楼号加一个房间号才能唯一定位 —个房间，前两个字节存楼号，后两个字节存房间号*/ int area; /* 面积 */ int max; /*所容纳人数*/ int current; /*己入住人数*/ struct node * prior, *next; /* 前驱和后继指针 */ }dnode; dnode* head = NULL; void output one(dnode* n) /* 输出一条记录 */ { int lou; i nt room; room = n-id Oxffff; lou = n-id 1 6; printf(%d\t%d\t%d\t%d\t%d\n, lou, room, n-n-m8x, n-cuirent); } void output () /*输出所有记录*/ { dnode* pos = head; if(head == NULL) { printf (no record\n〃)； return; } printf (z/lou\troom\tarea\tmax\tcurrent\nz/); while (pos) /* 循环调用 /* 循环调用 output one */ void sort () { int max = 0, i; dnode* pos = head; if(head == NULL) { printf (no record\n〃)； return; } while (pos) { if (pos-〉curr entmax) max = pos-current; pos = pos-next; } printf (〃lou\trooni\tdreei\tmeix\tcurrent\rT); for (i=max; i=0; i--) { pos = head; while (pos) { if (pos-current == i) output_one(pos) ; /* 循环调用 output^one */ pos = pos-next; int insert () /* 插入一条数据 */ { int lou; int room; long louL; dnode* pos = head; dnode* n = malloc(sizeof(dnode)); n-prior = NULL; n-next = NULL; //楼号、房间号、而积、所容纳人数、己入住人数 printf (，zbuilding:); scanf (/z%dz，, lou); printf(room:); seanf (%d, room); printf (^area/O ; seanf(%d, n-area); printf(max:); seanf(%d〃， n~max); printf (current:); scanf(/z%d，z, n-current); louL = lou; louL = louL? 1 6; n-id = louL + room; if(head==NULL) /*如果还没有头节点，就作为头节点*/ { head = n; return 1 ; } while (pos) { if (pos-id n-id) /*按顺序查找，如果找到比自己大地，就插 在它前面*/ { if (pos-prior) pos-prior-next = n; n-〉prior = pos-prior; pos-prior = n; if (pos-next) pos-next-prior = n; n-next = pos; if (pos 二二 head) head = n; return 1 ; } else if(pos-id == n-id) { free (n); return 0; /*有重复数据，插入不成功*/ if (!pos-next) /*如果己经到链表尾部，插入到后面*/ { pos-〉next = n; n-prior = pos; return 1 ; } pos = pos-next; return 1 ; int deleteO /*删除一条记录*/ { long id; int lou; int room; dnode* pos = head; printf (building:，z); scanf(%d： lou);