数据结构--队列实现舞伴配对问题+(舞伴程序++c++)

1、#include<iostream>#include <process.h>const bool TURE=1;const bool FAULT=0;using std:cout;using std:cin;using std:endl;class Node/链式堆栈的节点类public:Node();/构造函数重载1Node(int , int , int ,Node *);/构造函数重载2void const get_data(int &, int &,int &);/取节点数据 void put_data(int , int ,int );

2、/置节点数据bool put_next(Node *);/置节点的前驱节点域 bool put_prior(Node *);/置结点的后继结点域Node* const get_next()const;/取结点的前驱结点域 Node* const get_prior()const;/取结点的后继结点域 private:Node *next;Node *prior;int minute;int second;int num;Node:Node()minute=NULL;second=NULL;num=0;next=NULL;prior=NULL;Node:Node(int x, int y, in

3、t z ,Node *p)minute=x;second=y;num=z;next=NULL;prior=p;void const Node:get_data(int &x, int &y, int &z) x=minute;y=second;z=num;void Node:put_data(int x, int y, int z) minute=x;second=y;num=z;bool Node:put_next(Node *n)next=n;return TURE;bool Node:put_prior(Node *p)prior=p;return TURE;No

4、de* const Node:get_next() const return next;Node* const Node:get_prior() const return prior;class Queuepublic:Queue();/堆栈类的构造函数int get_length(void);/取堆栈的长度 bool push(int , int , int );/数据压栈bool pop(int &, int & , int &);/数据出栈 void print(void);int const seach(int );/搜索堆栈数据 protected:Node

5、base;/根节点Node *top;/顶节点int length;Queue:Queue():base()/构造函数,数据初始化 length=0;top=&base;int Queue:get_length(void)/取长度if(length<0) length=0;return length;bool Queue:push(int minute, int second, int num)/数据压栈 if(top!=NULL)length+;Node *temp=new Node(minute,second,num,top); top->put_next(temp);

6、top=temp;elsereturn FAULT;return TURE;bool Queue:pop(int &minute, int &second, int &num) if(base.get_next()!=NULL)length-;Node *temp=base.get_next();temp->get_data(minute,second,num);if(temp->get_next()!=NULL)Node *temp1=temp->get_next();temp1->put_prior(&base);base.put_n

7、ext(temp1);elsetop=&base;base.put_next(NULL);delete temp;elsereturn FAULT;return TURE;int const Queue:seach(int num)/搜索堆栈数据Node *temp;int x,y,z;temp=&base;while(temp!=NULL)temp->get_data(x,y,z);if(x=num) return 1;temp=temp->get_next();return 0;void Queue:print()/打印堆栈Node *temp;int x,y,

8、z,n=1;temp=base.get_next();if(temp=NULL)cout<<"数据为空"<<endl;while(temp!=NULL)temp->get_data(x,y,z);if(y=1)cout<<n<<": 第"<<x<<"号人士 性别：男 跳舞次数："<<z<<endl; elsecout<<n<<": 第"<<x<<"号人士 性

9、别：女 跳舞次数："<<z<<endl; temp=temp->get_next();n+;void ring_over(Queue &, Queue &, Queue &, Queue &);main()int sex,n=0,man_num=0,woman_num=0,number=0,degree5050=0,time=0,lun; Queue man,buffer_man,woman,buffer_woman;dosystem("cls");docout<<"请输入&quo

10、t;<<n+1<<"号人物性别（1:男士2:女士0:输入完毕）（总数不得超过100)"<<endl;cin>>sex;while(sex<0|sex>2);if(sex=1)man.push(n+1,sex,NULL);man_num+;n+;if(sex=2)woman.push(n+1,sex,NULL);woman_num+;n+;if(sex=0)system("cls");cout<<"输入结束，共有"<<woman_num+man_num&

11、lt;<"名人士参与舞会"<<endl; cout<<"打印男士信息"<<endl;man.print();cout<<"打印女士信息"<<endl;woman.print();system("pause");break;while(sex>=0&&sex<=2);system("cls");docout<<"请输入舞会轮数："<<endl;cin>&g

12、t;lun;while(lun<0);while(time<lun)for(;)if(woman.get_length()=0)ring_over(man,woman,buffer_man,buffer_woman); time+;break;else if(man.pop(man_num,sex,number)=0) ring_over(man,woman,buffer_man,buffer_woman); time+;break;elsebuffer_man.push(man_num,sex,number+1); if(woman.pop(woman_num,sex,numbe

13、r)buffer_woman.push(woman_num,sex,number+1); elsering_over(man,woman,buffer_man,buffer_woman); time+;break;degreeman_numwoman_num+;system("cls");cout<<"第"<<lun<<"舞会结束"<<endl;ring_over(man,woman,buffer_man,buffer_woman); cout<<"打印每人的跳舞总

14、数:"<<endl;cout<<"打印男士信息"<<endl;man.print();cout<<"打印女士信息"<<endl;woman.print();docout<<"请输入甲得号码"<<endl;cin>>man_num;while(man.seach(man_num)=0);docout<<"请输入乙得号码"<<endl;cin>>woman_num;while(woman.seach(woman_num)=0);cout<<"第"<<man_num<<"号男士"<<"和第"<<woman_num<<"号女士共跳了"<<degreeman_numwoman_num<<"次舞"<<endl;return 0;