qq上网站做我女朋友,网站建设课程心得体会,威海市城乡建设局网站,类似脉圈的推广软件早期使用的JavaSE用到的技术栈有#xff1a;Map集合,数组#xff0c;set集合#xff0c;只是简单实现了斗地主的模拟阶段#xff0c;感兴趣的小伙伴可以调试增加功能
代码如下#xff1a;
import java.util.*;public class Poker {public static void main(String[] arg… 早期使用的JavaSE用到的技术栈有Map集合,数组set集合只是简单实现了斗地主的模拟阶段感兴趣的小伙伴可以调试增加功能
代码如下
import java.util.*;public class Poker {public static void main(String[] args){/*数字对应编号*/MapInteger,String pokermap new HashMap();/*记录54个牌的编号*/ListInteger pokernumber new ArrayList();/*1.准备牌的阶段0--大王1--小王*/int ideax0;//初始化扑克牌编号pokermap.put(ideax,大王);pokernumber.add(ideax);ideax;pokermap.put(ideax,小王);pokernumber.add(ideax);ideax;String[] color {♣,♦,♥,♠};String[] number {A,2,3,4,5,6,7,8,9,10,J,Q,K};for (int i 0; i number.length; i) {for (int j0;jcolor.length;j){pokermap.put(ideax,color[j]number[i]);pokernumber.add(ideax);ideax;}}/*2.洗牌阶段利用collections工具类解决*/Collections.shuffle(pokernumber);//随机打乱顺序//System.out.println(pokernumber);/*3.发牌阶段*///定义三个玩家和底牌TreeSetInteger player1 new TreeSet();TreeSetInteger player2 new TreeSet();TreeSetInteger player3 new TreeSet();TreeSetInteger dp new TreeSet();for (int i 0; i pokernumber.size(); i) {if(i50){dp.add(pokernumber.get(i));} else if (i%30) {player1.add(pokernumber.get(i));} else if (i%31) {player2.add(pokernumber.get(i));} else if (i%32) {player3.add(pokernumber.get(i));}}/*4.用户玩家看牌阶段*/lookpoker(张三,player1,pokermap);lookpoker(李四,player2,pokermap);lookpoker(IU,player3,pokermap);lookpoker(底牌,dp,pokermap);}private static void lookpoker(String name, TreeSetInteger player, MapInteger, String pokermap) {System.out.println(name手中的牌为);for(Integer pokerNumber : player){String poker pokermap.get(pokerNumber);System.out.print(poker);}System.out.println();}}
