賓館客房信息管理系統(tǒng)

1、#include #include #include using namespace std;class list;class roomfriend class list;private:char num8;int capacity;int grade;double price;int checked;public:room():checked(0);int checkIn(int n);int room:checkIn(int n)if(n+checkedcapacity) return 0;checked+=n;return 1;class nodefriend class list;pr

2、ivate:room r;node *next,*last;public: ;class listprivate:node *head,*tail;public:list();list();void showTitle();void show(node *);void display();void insert(node *);void setData(node *);void add();void modi();node *qur(int);void menu();void select();void save();void list:showTitle()cout房間號t容量t檔次t價格t

3、已入住endl;void list:show(node *p)coutr.numtr.capacitytr.gradetr.pricetr.checkednext;showTitle();while(p!=tail)show(p);p=p-next;system(pause);void list:insert(node *p)node *q=head-next;while(q!=tail) if(strcmp(p-r.num,q-r.num)last=q;p-next=q-next;q-next-last=p;q-next=p;break;q=q-next;if(q=tail)p-next=t

4、ail;p-last=tail-last;tail-last-next=p;tail-last=p;void list:setData(node *p)int n;coutp-r.num;coutp-r.capacity;coutp-r.grade;coutp-r.price;coutn;if(!p-r.checkIn(n) cout容量不足,請重新輸入!endl;else break; while (1);void list:add()char ch;dosystem(cls);node *p=new node;setData(p);insert(p);coutch;while(ch!=y&

5、ch!=Y);node *list:qur(int method)if(method!=1)coutmethod;node *p=head-next;if(method=1)char num8;coutnum;while(p!=tail&strcmp(p-r.num,num)!=0) p=p-next;else if(method=2)int c;coutc;while(p!=tail) if(p-r.capacity=c) show(p);p=p-next;system(pause);system(cls);return NULL;return p;void list:modi()node

6、*p=qur(1);if(p=tail) cout未找到endl;system(pause);else setData(p);void list:save()ofstream out;out.open(d:info.txt,ios:out);if(!out)cerr保存失敗endl;system(pause);return;out房間號t容量t檔次t價格t已入住next;while(p!=tail)outr.numtr.capacitytr.gradetr.pricetr.checkednext;out.close();void list:menu()cout*賓館信息管理*endl* *en

7、dl* 1.瀏覽 *endl* 2.添加 *endl* 3.修改 *endl* 4.查詢 *endl* 5.退出 *endl* *endl*endl;void list:select()int n;do system(cls);menu();coutn;switch(n)case 1:display();break;case 2:add();break;case 3:modi();break;case 4:node *p=qur(2);if(p=tail) cout未找到next=tail;head-last=NULL;tail-last=head;tail-next=NULL;list:list()node* p=head-next;while(p!=t