package it.com;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;
public class shnegjiPoker {
public static void main(String[] args) {
//创建HashMap,键是编号,值是牌
HashMap<Integer, String> hm = new HashMap<>();
//创建ArrayList,存储编号
ArrayList<Integer> array = new ArrayList<>();
//创建花色数组和点数数组
String[] colors = {"♦", "♣", "♥", "♠"};
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, "小王");
array.add(index);
index++;
hm.put(index, "大王");
array.add(index);
//洗牌(洗的编号),用Collections的shuffle()方法实现
Collections.shuffle(array);
//发牌(发的也是编号,为了保证编号是排序的,创建TreeSet集合接受)
TreeSet<Integer> funong = new TreeSet<>();
TreeSet<Integer> zhongnong = new TreeSet<>();
TreeSet<Integer> pinnong = new TreeSet<>();
TreeSet<Integer> dipai = new TreeSet<>();
for (int i = 0; i < array.size(); i++) {
int x = array.get(i);
if (i >= array.size() - 3) {
dipai.add(x);
} else if (i % 3 == 0) {
funong.add(x);
} else if (i % 3 == 1) {
zhongnong.add(x);
} else if (i % 3 == 2) {
pinnong.add(x);
}
}
//调用看牌方法
lookPoker("富农",funong,hm);
lookPoker("中农",zhongnong,hm);
lookPoker("贫农",pinnong,hm);
lookPoker("底牌",dipai,hm);
}
//定义方法看牌(遍历TreeSet集合,获取编号,到HashMap集合找对应的牌)
public static void lookPoker(String name, TreeSet<Integer> ts, HashMap<Integer, String> hm) {
System.out.println(name + "的牌是:");
for (Integer key : ts) {
String poker = hm.get(key);
System.out.print(poker + " ");
}
System.out.println();
}
}