JAVA实现简单斗地主发牌流程
1.生成牌(52张普通牌和大小王)
2. 洗牌(把牌打乱)
3. 排序牌
package day14_Map;
//import jdk.nashorn.api.tree.Tree;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;
public class doudizhu_map {
public static void main(String[] args) {
//生成牌
String[] porks = {"1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "k"};
String[] colors = {"♠", "♥", "♣", "♦"};
ArrayList<Integer> list = new ArrayList<Integer>();
HashMap<Integer, String> map = new HashMap<>();
//把牌添加到集合中
int index = 0;
for (String pork : porks) {
for (String color : colors) {
map.put(index, color + pork);
list.add(index);
index++;
}
}
map.put(index, "小王");
list.add(index);
index++;
map.put(index, "大王");
list.add(index);
//洗牌
Collections.shuffle(list);
TreeSet<Integer> ts1 = new TreeSet<>();
TreeSet<Integer> ts2 = new TreeSet<>();
TreeSet<Integer> ts3 = new TreeSet<>();
TreeSet<Integer> dpts = new TreeSet<>();
//发牌
for (int i = 0; i < list.size(); i++) {
int x = list.get(i);
if (i >= list.size() - 3) {
dpts.add(x);
} else if (i % 3 == 0) {
ts1.add(x);
} else if (i % 3 == 1) {
ts2.add(x);
} else if (i % 3 == 2) {
ts3.add(x);
}
}
lookpaork("玩家1", ts1, map);
lookpaork("玩家2", ts2, map);
lookpaork("玩家3", ts3, map);
lookpaork("底牌", dpts, map);
}
public static void lookpaork(String name, TreeSet<Integer> ts, HashMap<Integer, String> mp) {
System.out.print(name + "的牌是: ");
for (Integer key : ts) {
String porks = mp.get(key);
System.out.print(porks + " ");
}
System.out.println();
}
}