舞伴配对问题java_用循环队列解决舞伴配对问题发现自己的问题

#define _CRT_SECURE_NO_WARNINGS#include#include#include#include#include#include

using namespacestd;

typedefintstatus;intn;

typedefstruct{char name[20];intsex;

}person;

typedefstruct{intfront;intrear;char elem[100][20];int number;//人的数量

}queue;void inperson(person &all) {

cout<< "请输这位同学的姓名和性别:";

scanf("%s", all.name);//在c和c++语言中输入字符串向字符数组中是不需要加&的，

/*输入参数是已经定义好的“字符数组名”, 不用加&, 因为在C语言中数组名就代表该数组的起始地址*/

//cout << "请输入这位同学的性别：";

scanf("%d", &all.sex);

}void inqueue(person all[], queue &man, queue &woman,int n) {//根据性别分别如男队和女队

for (int i = 0; i < n; i++) {if (all[i].sex == 1) {//strcpy(man.elem[man.number], all[i].name);

strcpy(man.elem[man.rear], all[i].name);

man.rear= (man.rear + 1) % 100;

man.number++;

}else{//strcpy(woman.elem[woman.number], all[i].name);

strcpy(woman.elem[woman.rear], all[i].name);

woman.rear= (woman.rear + 1) % 100;

woman.number++;

}

}

}

status initqueue(queue&man) {/*int n,i;

cout<

cin>>n;

man.number = n + 1;

cout<

for(i = 0;i < n;i ++){

scanf("%s",&man.elem[i]);

}

man.rear = n;*/man.rear= man.front = 0;

man.number= 0;return 0;

}int emptyqueue(queue man) {//用于判断队列中还有没有人

if (man.front ==man.rear)return 0;else

return 1;

}int dequeue(queue &man, char *str) {//删除队首元素

if (man.front ==man.rear)return 0;else{

strcpy(str, man.elem[man.front]);

man.front= (man.front + 1) % 100;

man.number--;return 1;

}

}intmain() {

person all[100];int n;//总人数

queue man;

queue woman;

initqueue(man);

initqueue(woman);//初始化两个队列，使两个队列的首和尾都为零

cout << "请输入本班的人数 ：";

cin>>n;for (int i = 0; i < n; i++) {//把所有人都存入一个队列

inperson(all[i]);

}//根据性别入队列

inqueue(all, man, woman,n);//按性别分别入队

char str[20];while (emptyqueue(man) && emptyqueue(woman)) {//配对,改这里没有想好停止条件，我本来写的是“||”应该是当两个都不为空时才停止

dequeue(man, str);

dequeue(woman, str);

}if (man.front == man.rear&&woman.front ==woman.rear) {

cout<< "完全配对";

cout<

}else if (woman.front !=woman.rear) {

cout<< "下一位配对的女性是：";

printf("%s", woman.elem[woman.front]);

cout<

}elseprintf("下一位配对的男性是：%s", man.elem[man.front]);

Sleep(50000);return 0;

}