数据结构-队列实现舞伴配对问题+

1、#iiiclude#iiiclude const bool TURE=1;const bool FAULT=0;using std:cout;using std:cm;using std:endl;class Node链式堆栈的节点类public:Node。;/构造函数重载1Node(int, int, int .Node *);/构造函数重载 2void const get_data(iiit &, mt &,int &)/取节点数据 void put_data(iiit, int ,iiit);置节点数据 bool put_next(Node *);/置节点的前驱节点域 bool put_

2、pnoi(Node *);置结点的后继结点域 Node* const gecnext()coiist/取结点的前驱结点域 Node * const get_pnor()const;取结点的后继结点域 private:Node *next;Node *pnor;mt niniute;mt second;mt num;Node:Node()niiiiute=NULL;second=NULL;num=0;next=NULL;pnor=NULL;Node:Node(iiit x, int y, int z .Node *p)niiiiute=x;second=v;num=z;next=NULL;pno

3、r=p;void const Node:get_data(int &x, int &y, hit &z)x=niuiute;y=second;z=num;void Node: :put_data(iiit x, int y, int z)niiiiute=x;secondly;num=z;bool Node: :put_next(Node *n)next=n;return TURE;bool Node:put_prior(Node *p)pnor=p;return TURE;Node* const Node:geCnextQ constreturn next;Node* const Node:

4、get_piiorQ constreturn prior;class Queue(public:Queue();堆栈类的构造函数mt get_length(void);/ 取堆栈的长度bool push(int, int. mt);/数据压栈bool pop(int &, mt & , mt &);数据出栈 void print(void);mt const seach(int);搜索堆栈数据 protected:Node base;/根节点Node *top;/顶节点 mt lengtli;Queue: :Queue():base()/构造函数，数据初始化length=0;top=&base

5、;hit Queue:get_length(void)/取长度if(lengthput_next(temp);top=tenip;)else(return FAULT;)return TURE;bool Queue:pop(int &nimute, mt &second, mt &num)if(base. get_next()! =NULL)(length-;Node *temp=base.get_next();temp-geCdata(nmiute.second,num);if(temp-get_next() !=NULL)(Node *temp 1 =temp-get_next();tem

6、p 1 -put_piior(&base);base.put_next(templ);)else(top=&base;base.put_next(NULL);)delete temp:elsereturn FAULT;)return TURE;mt const Queue: :seach(int num)/IS索堆栈数据Node *temp;int x,y,z;temp=&base;wliile(temp !=NULL)(temp-get_data(x,y,z);if(x=num) leturn 1;temp=tenip-get_nextQ;return 0;void Queue:piint(

7、)/打印堆栈Node *temp;mt x,y,z,n=l;temp=base. get_nextQ;if(temp=NULL)coutH 数据为空 ”v vendl;wliile(temp !=NULL)(temp-get_data(x,y,z);if(y=l)coutnH:第,xM号人士 性别：男 跳舞次数：”vvzvvendl; elsecoutn:第vvxvv”号人士 性别：女 跳舞次数：zend; temp=tenip-get_nextQ; n+;)void ring_over(Queue &. Queue & Queue & Queue &);main()int sex,ii=0.

8、maii_num=0,woman_num=0,iiumber=0,degree5050=0,time=0,hm;Queue man.bufifei_man,woman,buffer_wonian;dosysteni(Mclsn);do(cout请输入”n+ivv“号人物性别(1：男士 2:女士 0:输入完毕)(总数不得超过 100)Hendl;cinsex;while(sex2);if(sex=l)(nian.push(n+1,sex,NULL);nian_num+;n+;)iRsex=2)(woman.push(n+1 ,sex,NULL);woman_num+4-；n+;if(sex=0)

9、(system(MclsH);coutn输入结束，共有”vvwoman_mim+nian_mim=0&sex=2);system(HclsM);do(cout请输入舞会轮数：“vvendl;cinlun;while(lun0);while(timelun) for(；)if(woman.geclength()=0) nng_over(maii,woinan,buffer_nian,buffer_woman);time+;break;else if(nian.pop(nian_num,sex,numbei)=0)(nng_over(maii,woinan,buffer_nian,buffer_w

10、oman);time+;break;else(buflfei_nian.push(man_nunLsex.number+1);)if(woman.pop(woman_num,sex,numbei)bufifei_wonian.push(woman_num,sex,numbei+l);else(nng_over(maii,woinan,buffer_nian,buffer_woman);time+;break;degree nian_num woman_num+;system(Hclsn);coutH 第“vvhmvv” 舞会结束 Hendl;iiiig_ovei(man,woman.buflf

11、er_man,buffer_wonian);cout打印每人的跳舞总数:,*endl;cout打印男士信息endl;maii.pnntQ;cout打印女士信息endl;woman, print。；do(cout,f请输入甲得号码”endl;cinnian_num; while(man. seach(nian_num)=O);do(coutM请输入乙得号码Hendl;c inwoman_num;while(wonian. seach(woinan_num)=0);coutM 第,nian-numH 号男 士 HH 和第 ”vvwoman_iiumvv” 号女士 共跳了 Mdegreemaivnum woman_numM 次舞 Hendl;return 0;void ring_over(Queue &man. Queue &woman.