Java数据结构-舞会问题Dance Problem

import java.util.Iterator;
import java.util.Queue;
public class DancersProblem {
	public static void solve(int times,Queue men,Queue women) {
		if (!men.isEmpty() && !women.isEmpty() && times > 0) {
			int count = 1;
			int scale = men.size() >= women.size() ? women.size() : men.size();
			Queue handle = men.size() >= women.size() ? men : women;
			while(count <= times) {
				System.out.println("第"+count+"轮：");
				for (int i = 0; i < scale; i++) {
					String man = men.peek();//男队队头出队
					String woman = women.peek();//女队队头出队
					men.add(men.poll());//将出队的添加到队尾准备入队
					women.add(women.poll());
					System.out.print(man+"-匹配-"+woman+" ");
				}
				System.out.println();
				//输出要等下一轮的人
				Iterator item = handle.iterator();
				int remain = 1;
				while(item.hasNext() && remain <= handle.size()-scale) {
					String remainPeo = item.next();
					System.out.print(remainPeo+" ");
					remain++;
				}
				System.out.print("请等待下一轮");
				System.out.println();
				count++;
			}
			System.out.println();
		}else {
			System.out.println("不符合规则");
		}	
	}
}