【Java学习笔记】16.TreeMap集合实现斗地主洗牌发牌

/**
* 用TreeMap实现斗地主发牌洗牌
* 并将手牌按照顺序排列
*/
import java.util.ArrayList;
import java.util.Collections;
import java.util.TreeMap;
import java.util.TreeSet;

public class Poker2 {
public static void main(String[] args) {
//创建TreeMap集合
TreeMap<Integer, String> pokers = new TreeMap<>();
//创建扑克牌
String[] colors = {"♠","♥","♦","♣"};
String[] numbers = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
//创建ArrayList集合，用来存储牌从小到大的索引
ArrayList<Integer> indexs = new ArrayList<>();
//开始添加牌
int index = 0;
for (String number : numbers) {
for (String color : colors) {
pokers.put(index, color+number);
indexs.add(index);
index++;
}
}
//添加大王小王
pokers.put(index, "小王");
indexs.add(index);

index++;
pokers.put(index, "大王");
indexs.add(index);

//开始洗牌。shuffle()方法将随机打乱集合顺序
Collections.shuffle(indexs);
//创建三位玩家和底牌的TreeSet集合
TreeSet<Integer> liudehua = new TreeSet<>();
TreeSet<Integer> guodegang = new TreeSet<>();
TreeSet<Integer> zhoujielun = new TreeSet<>();
TreeSet<Integer> dipai = new TreeSet<>();

for (int i = 0; i < indexs.size(); i++) {
if (i>=indexs.size()-3) {
dipai.add(indexs.get(i));
}else if (i%3==0) {
liudehua.add(indexs.get(i));
}else if (i%3==1) {
guodegang.add(indexs.get(i));
}else if (i%3==2) {
zhoujielun.add(indexs.get(i));
}
}

//看牌
lookPoker("刘德华",liudehua,pokers);
lookPoker("郭德纲",guodegang,pokers);
lookPoker("周杰伦",zhoujielun,pokers);
lookPoker("最后三张",dipai,pokers);

}

private static void lookPoker(String name, TreeSet<Integer> indexs,
TreeMap<Integer, String> pokers) {
System.out.print(name+"的牌");
for (Integer index : indexs) {
System.out.print(pokers.get(index)+"  ");
}
System.out.println();
}

}