[学习交流] 用集合模拟洗牌

package com.itcast_03;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;
public class Poker {
public static void main(String[] args) {
HashMap<Integer,String> hm = new HashMap<Integer,String>();
ArrayList<Integer> list = new ArrayList<Integer>();
String[] numbers = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
String[] colors = {"♥","♠","♣","♦"};
Integer index = 0;
for(String number : numbers){
for(String color : colors){
hm.put(index, color+number);
list.add(index);
index++;
}
}
hm.put(index, "小王");
list.add(index);
index++;
hm.put(index, "大王");
list.add(index);
Collections.shuffle(list);
TreeSet<Integer> caocao = new TreeSet<Integer>();
TreeSet<Integer> liubei = new TreeSet<Integer>();
TreeSet<Integer> sunquan = new TreeSet<Integer>();
TreeSet<Integer> dipai = new TreeSet<Integer>();
for(int x = 0 ; x < list.size(); x++){
if(x>=list.size()-3){
dipai.add(list.get(x));
}else if(x%3==0){
caocao.add(list.get(x));
}else if(x%3==1){
liubei.add(list.get(x));
}else if(x%3==2){
sunquan.add(list.get(x));
}
}
lookpoker("曹操", caocao, hm);
lookpoker("刘备", liubei, hm);
lookpoker("孙权", sunquan, hm);
lookpoker("底牌", dipai, hm);
}
public static void lookpoker(String name,TreeSet<Integer> ts,HashMap<Integer,String> hm){
System.out.print(name+"的牌是：");
for(Integer key : ts){
String value = hm.get(key);
System.out.print(value+",");
}
System.out.println();
}
}

复制代码

帐号		自动登录	找回密码
密码			加入黑马

0 个回复