import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;
public class Test3 {
/**
* 1.创建集合,存储扑克牌
* 2.洗牌
* 3.发牌
* 底牌单独看
* 4.看牌
*/
public static void main(String[] args) {
String [] num = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
String [] color = {"红桃","黑桃","梅花","方片"};
HashMap<Integer, String> hm = new HashMap<Integer, String>();
ArrayList<Integer> list = new ArrayList<>();
int index = 0;
for (String s1 : num) {
for (String s2 : color) {
hm.put(index, s2.concat(s1));
list.add(index);
index++;
}
}
list.add(index);
hm.put(index, "小王");
hm.put(++index, "大王");
list.add(index);
/*System.out.println(hm);
System.out.println(list);*/
Collections.shuffle(list);
System.out.println("重新洗牌啦!!");
System.out.println(list);
System.out.println();
TreeSet<Integer> xiaogu = new TreeSet<Integer>();
TreeSet<Integer> xiaowei = new TreeSet<Integer>();
TreeSet<Integer> xiaopan = new TreeSet<Integer>();
TreeSet<Integer> dipai = new TreeSet<Integer>();
for (int i = 0 ; i < list.size() ; i++){
if (i >= list.size() - 3){
dipai.add(list.get(i));
}else if(i % 3 == 0){
xiaogu.add(list.get(i));
}else if(i % 3 == 1){
xiaowei.add(list.get(i));
}else {
xiaopan.add(list.get(i));
}
}
//看牌
lookPoker(hm,xiaogu,"小顾");
lookPoker(hm,xiaowei,"小伟");
lookPoker(hm,xiaopan,"小攀");
lookPoker(hm,dipai,"底牌");
}
public static void lookPoker(HashMap<Integer, String> hm,TreeSet<Integer> ts,String name){
System.out.print(name + "的牌是:");
for (Integer i : ts) {
System.out.print(hm.get(i) + " ");
}
System.out.println();
}
}
创建集合,存储扑克牌---改进版
最新推荐文章于 2022-12-07 09:59:26 发布