舞伴问题
1、先建立一个舞者队列,依次往队列中添加人员信息;
2、分别创建男女队列;
3、从舞者队列中依次将队首元素出队并判断其性别并添加至男队或女队;
4、分别从男队和女队出队队首元素并配对输出;
5、将未完成的一队队首元素输出(男队的队首成员名称);
二、主要函数算法步骤及代码展示
【算法步骤】
1、初始化Mdancers队列和Fdancers队列;
2、反复循环,依次将跳舞者姓名根据性别插入Mdancers队列和Fdancers队列;
3、当Mdancers队列和Fdancers队列均为非空时,反复循环,依次输出男女舞伴的姓名;
4、如果Mdancers队列为空和Fdancers队列为非空时,则输出Fdancers对列的队头女士的姓名;
5、如果Fdancers队列为空和Mdancers队列为非空时,则输出Mdancers队列的队头男士的姓名;
【算法描述】
//舞伴问题解决
void dancersolve(Person dancer[], int num, int m, SqQueue male, SqQueue female)
{//结构体数组中dancer中存放跳舞的男女姓名,num是跳舞的人数
for (int j = 0; j < m; j++)
{
cout << "第" << j + 1 << "轮:" << endl;
for (int i = 0; i < num; i++)
{
if (dancer[i].sex == 'F')
EnQueue(female, dancer[i]);//插入女队
else
EnQueue(male, dancer[i]);//插入男队
}
cout << "The dancing partners are:\n";
while (!QueueEmpty(male) && !QueueEmpty(female))
{//依次输入男女舞伴问题
Person p;
DeQueue(male, p);
cout << p.name << ' ';//女士出列
DeQueue(female, p);
cout << p.name << endl;//男士出列
}
Person e;
if (!QueueEmpty(female))//女士队列非空,输出队头女士的姓名
{
e = GetHead(female);//取女士队头
cout << "The first woman to get a partner is:" << e.name << endl;
}
else if (!QueueEmpty(male))//男士队列非空,输出队头男士的姓名
{
e = GetHead(female);//取男士队头
cout << "The first man to get a partner is:" << e.name << endl;
}
}
}
完整代码:
#include <iostream>
using namespace std;
#define OK 1
#define ERROR 0
#define MAXSIZE 100
typedef int Status;
/*跳舞这个人信息*/
typedef struct
{
char name[20];//名字
char sex;//F为女性,M为男性
}Person;
/*队列的顺序存储结构*/
typedef struct
{
Person* base;//队列中数据元素类型为Person
int front;//头指针
int rear;//尾指针
}SqQueue;
typedef Person ElemType;
/*队列初始化*/
Status InitQueue(SqQueue& Q)
{//构造一个空队列Q
Q.base = new Person[MAXSIZE];
if (!Q.base)
exit(OVERFLOW);
Q.front = Q.rear = 0;
return OK;
}
/*求队列的长度*/
int QueueLength(SqQueue* Q)
{
return(Q->rear - Q->front + MAXSIZE) % MAXSIZE;
}
/*判断队列是否为空*/
bool QueueEmpty(SqQueue& Q)
{
if (Q.front == Q.rear)
return true;//队满
else
return false;
}
Status EnQueue(SqQueue& Q, Person e)
{//插入元素e为Q的新的队尾元素
if ((Q.rear + 1) % MAXSIZE == Q.front)//尾指针在循环意义上加1后等于头指针,表明队满
{
return ERROR;
}
Q.base[Q.rear] = e;
Q.rear = (Q.rear + 1) % MAXSIZE;//队尾指针加1
return OK;
}
/*出队(保留队头元素)删除Q的队头元素,用e返回其值*/
Status DeQueue(SqQueue& Q, Person& e)
{
if (Q.front == Q.rear)
return ERROR;//队空
e = Q.base[Q.front]; //保留队头元素
Q.front = (Q.front + 1) % MAXSIZE;//队头指针加1
return OK;
}
/*出队(不保留对头元素)*/
Status DeQueuee(SqQueue& Q)
{
if (Q.front == Q.rear)
return ERROR;
Q.front = (Q.front + 1) % MAXSIZE;
return OK;
}
//取队头元素
Person GetHead(SqQueue& Q)
{//返回Q的队头元素,不修改队头指针
if (Q.rear != Q.front)
{
return Q.base[Q.front];//返回队头元素的值,队头指针不变
}//队列非空
}
//舞伴问题解决
void dancersolve(Person dancer[], int num, int m, SqQueue male, SqQueue female)
{//结构体数组中dancer中存放跳舞的男女姓名,num是跳舞的人数
for (int j = 0; j < m; j++)
{
cout << "第" << j + 1 << "轮:" << endl;
for (int i = 0; i < num; i++)
{
if (dancer[i].sex == 'F')
EnQueue(female, dancer[i]);//插入女队
else
EnQueue(male, dancer[i]);//插入男队
}
cout << "The dancing partners are:\n";
while (!QueueEmpty(male) && !QueueEmpty(female))
{//依次输入男女舞伴问题
Person p;
DeQueue(male, p);
cout << p.name << ' ';//女士出列
DeQueue(female, p);
cout << p.name << endl;//男士出列
}
Person e;
if (!QueueEmpty(female))//女士队列非空,输出队头女士的姓名
{
e = GetHead(female);//取女士队头
cout << "The first woman to get a partner is:" << e.name << endl;
}
else if (!QueueEmpty(male))//男士队列非空,输出队头男士的姓名
{
e = GetHead(female);//取男士队头
cout << "The first man to get a partner is:" << e.name << endl;
}
}
}
//主函数
int main()
{
int n;
cout << "请输入跳舞人的人数:";
cin >> n;
Person* dancer = new Person[n];
cout << "请依次输入跳舞人的信息:" << endl;
for (int i = 0; i < n; i++)
{
cout << "name:";
cin >> dancer[i].name;
cout << "sex:";
cin >> dancer[i].sex;
}
int m;
cout << "请输入舞会的轮数:";
cin >> m;
SqQueue male, female;
InitQueue(male);
InitQueue(female);
dancersolve(dancer, n, m, male, female);
return 0;
}
运行结果展示:
第一次写,如果有不正确之处,请留言!
帮忙点个关注!!!