本文主要是介绍6-8 舞伴问题 分数 15,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
void DancePartner(DataType dancer[], int num)
{LinkQueue maleQueue = SetNullQueue_Link();LinkQueue femaleQueue = SetNullQueue_Link();// 将男士和女士的信息分别加入对应的队列for (int i = 0; i < num; i++) {if (dancer[i].sex == 'M'){EnQueue_link(maleQueue, dancer[i]);}else if (dancer[i].sex == 'F'){EnQueue_link(femaleQueue, dancer[i]);}}// 配对舞伴while (!IsNullQueue_link(maleQueue) && !IsNullQueue_link(femaleQueue)) {DataType male = FrontQueue_link(maleQueue);DataType female = FrontQueue_link(femaleQueue);printf("%s %s\n", female.name, male.name);DeQueue_link(maleQueue);DeQueue_link(femaleQueue);}printf("\n");// 输出没有配对的队头元素的姓名if (!IsNullQueue_link(maleQueue)) {DataType single = FrontQueue_link(maleQueue);printf("%s\n", single.name);}if (!IsNullQueue_link(femaleQueue)) {DataType single = FrontQueue_link(femaleQueue);printf("%s\n", single.name);}
}
这篇关于6-8 舞伴问题 分数 15的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!