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

《宿舍管理系统链表c语言c数据结构链表课程设计》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、#include★include#inelude^include/*采用双向链表结构，方便添加删除和排序*/typedefstructnode{/*定义结构体类型dnode*/longid;/*楼号和房间号，因为一个楼号加一个房间号才能唯一定位—个房间，前两个字节存楼号，后两个字节存房间号*/intarea;/*面积*/intmax;/*所容纳人数*/intcurrent;/*己入住人数*/structnode*prior,*next;/*前驱和后继指针*/}d

2、node;dnode*head=NULL;voidoutputone(dnode*n)/*输出一条记录*/{intlou;introom;room=n->id&Oxffff;lou=n->id>>16;printf("%dt%dt%dt%dt%d",lou,room,n-n->m8x,n->cuirent);}voidoutput()/*输出所有记录*/{dnode*pos=head;if(head==NULL){printf("norecord〃)；return;}printf(z/loutroomtareatm

3、axtcurrentz/);while(pos)/*循环调用outputone*/outputone(pos);pos=pos->next;voidsort(){intmax=0,i;dnode*pos=head;if(head==NULL){printf("norecord〃)；return;}while(pos){if(pos-〉current>max)max=pos->current;pos=pos->next;}printf(〃loutroonitdreeitmeixtcurrentrT);for(i=max

4、;i>=0;i--){pos=head;while(pos){if(pos->current==i)output_one(pos);/*循环调用output^one*/pos=pos->next;intinsert()/*插入一条数据*/{intlou;introom;longlouL;dnode*pos=head;dnode*n=malloc(sizeof(dnode));n->prior=NULL;n->next=NULL;//楼号、房间号、而积、所容纳人数、己入住人数printf(，zbuilding:");scanf(/z%dz

5、，,&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«16;n->id=louL+room;if(head==NULL)/*如果还没有头节点，就作为头节点*/{head=n;return1;}while(pos){if(pos->id>n->

6、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;return1;}elseif(pos->id==n->id){free(n);return0;/*有重复数据，插入不成功*/if(!pos->next)/*如果己经到链表尾部，插入到后面*/{pos-〉next=n;n-

7、>prior=pos;return1;}pos=pos->next;return1;intdeleteO/*删除一条记录*/{longid;intlou;introom;dnode*pos=head;printf("building:，z);scanf("%d：&lou);printf("room:");seanf("%d",&room);id=lou;id«=16;id+=room;if(head==NULL){printf("norecord");return0;}while(pos){if(pos->id==id)/*找到匹配

8、地项，进行删除*/{if(pos~>prior)pos->prior一〉next=pos->next;if(pos->next)pos->next一>prior=pos->prior;if(pos==hea