随机点名器_带概率,不重复
public class PokerGame2 {
//只要牌的对象和只能对应就好了,不用treemap
static HashMap<Integer,String> poker=new HashMap<>();
static ArrayList<Integer> list=new ArrayList<>();
static {
String [] colors={"♦","♣","♥","♠"};
String [] numbers={"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
int index=1;
for (String number : numbers) {
for (String color : colors) {
list.add(index);
poker.put(index++,color+number);
}
}
list.add(index);
poker.put(index++,"小王");
list.add(index);
poker.put(index++,"大王");
//System.out.println(poker);
//System.out.println(list);
}
public PokerGame2(){
//洗牌
Collections.shuffle(list);
//System.out.println(list);
//发牌
//地主牌
TreeSet<Integer> DiZhuPai = new TreeSet<>();
//玩家1
TreeSet<Integer> Player1 = new TreeSet<>();
//玩家2
TreeSet<Integer> Player2 = new TreeSet<>();
//玩家3
TreeSet<Integer> Player3 = new TreeSet<>();
for (int i = 0; i < list.size(); i++) {
int poker = list.get(i);
if(i<=2){
DiZhuPai.add(poker);
}else if(i%3==0){
Player1.add(poker);
}else if(i%3==1){
Player2.add(poker);
}else if(i%3==2){
Player3.add(poker);
}
}
//看牌
LookPoker("地主",DiZhuPai);
LookPoker("香香",Player1);
LookPoker("哈哈",Player2);
LookPoker("宝宝",Player3);
}
public static void LookPoker(String name,TreeSet<Integer> list){//看牌
System.out.print(name+": ");
for (Integer i : list) {
System.out.print(poker.get(i)+" ");
}
System.out.println();
}
}
------------------
public class App {
public static void main(String[] args) {
new PokerGame2();
}
}
本博客所有文章除特别声明外,均采用 CC BY-NC-SA 4.0 许可协议。转载请注明来源 Hexo!