java实现扑克牌游戏(洗牌,发牌,排序)
package poker.bean;
import lombok.AllArgsConstructor;
import lombok.Getter;
import lombok.NoArgsConstructor;
import lombok.Setter;
import java.lang.annotation.ElementType;
import java.util.*;
/**
* @Author:Liku
* @Date:2022/11/26-14:05
* @Name:JavaSE
* @Since:jdk1.8
* @Description:
*/
@Setter
@Getter
public class Poker {
private Poker() {
}
public static void allPoker() {
String[] color = {"♠", "♥", "♦", "♣"};
String[] num = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2"};
Map<Integer, String> pokers = new HashMap<>();
List<Integer> keyList = new ArrayList<>();
int index = 0;
//外层循环数字,内层循环花色,这样能保证k值跟牌面值相匹配
for (String s : num) {//外层循环数字
for (String s1 : color) {//内层加上颜色
pokers.put(index, s1 + s);
keyList.add(index++);
}
}
pokers.put(index, "♚");
keyList.add(index++);
pokers.put(index, "♔");
keyList.add(index);
Collections.shuffle(keyList);//打乱扑克牌下标序号,并且分配每个玩家的key值
List<Integer> player1 = new ArrayList<>(17);
List<Integer> player2 = new ArrayList<>(17);
List<Integer> player3 = new ArrayList<>(17);
List<Integer> dzPlay = new ArrayList<>(3);
//给每个人发牌
for (int i = 0; i < keyList.size(); i++) {
if (i >= keyList.size() - 3) {
dzPlay.add(keyList.get(i));
} else if (i % 3 == 1) player1.add(keyList.get(i));
else if (i % 3 == 2) player2.add(keyList.get(i));
else if (i % 3 == 0) player3.add(keyList.get(i));
}
//将各位玩家的手牌排序
Collections.sort(player1);
Collections.sort(player2);
Collections.sort(player3);
Collections.sort(dzPlay);
//创建玩家的list来装牌
List<String> poker1 = new ArrayList<>();
List<String> poker2 = new ArrayList<>();
List<String> poker3 = new ArrayList<>();
List<String> dzPoker = new ArrayList<>();
//排完序根据key值,将扑克牌的value给玩家
for (Integer integer : player1) {
poker1.add(pokers.get(integer));
}
for (Integer integer : player2) {
poker2.add(pokers.get(integer));
}
for (Integer integer : player3) {
poker3.add(pokers.get(integer));
}
for (Integer integer : dzPlay) {
dzPoker.add(pokers.get(integer));
}
System.out.println(poker1);
System.out.println(poker2);
System.out.println(poker3);
System.out.println(dzPoker);
}
public static void main(String[] args) {
allPoker();
}
}
结果展示:
方法二:因为treeset有自动排序功能
private static void playCard() {
String[] num = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2"};
String[] color = {"♠", "♥", "♦", "♣"};
Map<Integer, String> cardMap = new HashMap<>();
List<Integer> keyList = new ArrayList<>();
int index = 0;//将52张牌编号
for (String s : num) {
for (String s1 : color) {
cardMap.put(index, s1 + s);
keyList.add(index++);
}
}
cardMap.put(index, "♔");
keyList.add(index++);
cardMap.put(index, "♚");
keyList.add(index);
Collections.shuffle(keyList);
TreeSet<Integer> player01 = new TreeSet<Integer>();
TreeSet<Integer> player02 = new TreeSet<Integer>();
TreeSet<Integer> player03 = new TreeSet<Integer>();
TreeSet<Integer> dipai = new TreeSet<Integer>();
for (int i = 0; i < keyList.size(); i++) {
if (i >= keyList.size() - 3) {
dipai.add(keyList.get(i));
} else if (i % 3 == 1) player01.add(keyList.get(i));
else if (i % 3 == 2) player02.add(keyList.get(i));
else if (i % 3 == 0) player03.add(keyList.get(i));
}
List<String> poker1 = new ArrayList<>();
List<String> poker2 = new ArrayList<>();
List<String> poker3 = new ArrayList<>();
List<String> dzPoker = new ArrayList<>();
for (Integer integer : player01) {
poker1.add(cardMap.get(integer));
}for (Integer integer : player02) {
poker2.add(cardMap.get(integer));
}
for (Integer integer : player03) {
poker3.add(cardMap.get(integer));
}
for (Integer integer : dipai) {
dzPoker.add(cardMap.get(integer));
}
System.out.println(poker1);
System.out.println(poker2);
System.out.println(poker3);
System.out.println(dzPoker);
}
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· DeepSeek 开源周回顾「GitHub 热点速览」
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· AI与.NET技术实操系列(二):开始使用ML.NET
· 单线程的Redis速度为什么快?