假设在周末舞会上，男士和女士进入舞厅时，各自排成一队。跳舞开始时，依次从男队和女队的队头上各出一人配成舞伴。若两队初始人数不相同，则较长的那一队中未配对者等待下一轮舞曲。现要求写一算法模拟上述舞伴配对问题。(Suppose, at the weekend dance, men and women enter a ballroom together in a row. Dancing began, followed by men and women from the teams head out of one pair each partner. If the initial number of teams is not the same, the longer team mate is waiting for the next dance. An algorithm is now required to simulate the partner pairing problem.)相关搜索： 课设
数据结构
舞会问题