public static void main(String[] args) {
//创建HashMap键是编号 值是牌
HashMap<Integer, String> hm = new HashMap<Integer, String>();
//创建ArrayList 存储编号
ArrayList<Integer> array = new ArrayList<Integer>();
//创建花色数组和点数数组
String[] colors = {"f", "h", "ei", "x"};
String[] numbers = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A"};
//从0开始王HashMap里面存储编号,并存储对应的牌,同时往ArrayList里面存储编号
int index = 0;
for (String number : numbers) {
for (String color : colors) {
hm.put(index, color + number);
array.add(index);
index++;
}
}
hm.put(index, "xwang");
array.add(index);
index++;
hm.put(index, "dwang");
array.add(index);
//洗牌
Collections.shuffle(array);
//发牌
TreeSet<Integer> lqxSet = new TreeSet<Integer>();
TreeSet<Integer> lySet = new TreeSet<Integer>();
TreeSet<Integer> fqySet = new TreeSet<Integer>();
TreeSet<Integer> dpSet = new TreeSet<Integer>();
for (int i = 0; i < array.size(); i++) {
int x = array.get(i);
if (i >= array.size() - 3) {
dpSet.add(x);
} else if (i % 3 == 0) {
lqxSet.add(x);
} else if (i % 3 == 1) {
lySet.add(x);
} else if (i % 3 == 2) {
fqySet.add(x);
}
}
lookPoker("linqingxia",lqxSet,hm);
lookPoker("liuyan",lySet,hm);
lookPoker("fengqingyang",fqySet,hm);
lookPoker("dipai",dpSet,hm);
}
//定义看牌方法(遍历TreeSet集合,获取编号,到HashMap集合找对应的牌)
public static void lookPoker(String name, TreeSet<Integer> ts,HashMap<Integer,String>hm)
{
System.out.println(name+":pai:");
for(Integer key:ts)
{
String poker=hm.get(key);
System.out.println(poker+" ");
}
System.out.println();
}