/**
* 斗地主,出牌规则大小
* 小的在前面,大的在后面
* 规则:黑红梅方
* 3-K,2,小王,大王
*/
import java.util.*;
public class DouDiZhuSort {
public static void main(String[] args) {
//创建Map集合,HashMap,键是牌序号,值是点数+花色
//序号利用变量,从0开始51
//创建List;arraylist存储编号
HashMap<Integer,String> hashMap = new HashMap<>();
ArrayList<Integer> arrayList = new ArrayList<>();
int index = 0;
//定义数组2个,保存花色和点数
String[] colors = {"♠","♥","♣","♦"};
String[] numbers = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
for(String number : numbers){
for(String color : colors){
//map 存储序号,存储键值
hashMap.put(index, color+number);
arrayList.add(index);
index++;
}
}
//将王存储到集合中
hashMap.put(52, "小王");
arrayList.add(52);
hashMap.put(53, "大王");
arrayList.add(53);
//System.out.println(hashMap);//存储的键是序号,只是点数和花色
//System.out.println(arrayList);//存储是序号
//洗牌
Collections.shuffle(arrayList);
//创建四个集合接收打牌
//接收到的是牌的序号,对序号进行排序 TreeSet
TreeSet<Integer> play1 = new TreeSet<>();
TreeSet<Integer> play2 = new TreeSet<>();
TreeSet<Integer> play3 = new TreeSet<>();
TreeSet<Integer> bottom = new TreeSet<>();
for(int i = 0;i<arrayList.size();i++){
//最后三张牌是地主牌
if(i >= arrayList.size()-3){
bottom.add(arrayList.get(i));
}else if(i % 3==0){
play1.add(arrayList.get(i));
}else if(i % 3==1){
play2.add(arrayList.get(i));
}else if(i % 3==2){
play3.add(arrayList.get(i));
}
}
lookPoker("玩家一", play1,hashMap );
lookPoker("玩家二", play2,hashMap );
lookPoker("玩家三", play3,hashMap );
lookPoker("地主牌", bottom,hashMap );
}
//调用看牌的方法,手上的牌是个序号,使用需要到hashMap中查看点数
public static void lookPoker(String name,TreeSet<Integer> treeSet,HashMap<Integer,String> hashMap){
System.out.print(name + " ");
//遍历集合是TreeSet,获取到的牌的序号
for(Integer key : treeSet){
//根据排序,当作键,到hashMap中去找
String value = hashMap.get(key);
System.out.print(value);
System.out.print(" ");
}
System.out.println();
}
}
JAVA 利用集合完成斗地主的洗牌 发牌 排序 看牌功能
最新推荐文章于 2023-07-08 21:28:28 发布