分析:
1)创建一个牌盒
牌盒:使用"集合"思想
HashMap<Integer ,String>
键存储的是牌的编号
值存储的是每一个牌(花色和点数)
ArrayList
存储编号
2)装牌
两个数组:
定义一个编号:int index = 0;
点数数组:
3 4 5 6 7 8 9 10 J Q K A 2
花色数组:
♥ ♠ ♣ ♦
2.1)将点数数组和花色数组遍历,并且拼接
2.2)给HashMap<Integer ,String>存储编号和牌
给ArrayList存储编号
index ++
2.3)给HashMap<Integer ,String>单独存储小王,大王
给ArrayList添加小王对应的编号,并拼接index++
3)洗牌
洗的是编号
Collections
public static void shuffle(List<?> list):随机置换
4)发牌
发的是编号,为了保证每个人手上有序,所以每个人都要TreeSet
5)看牌
封装成一个功能
lookPoker(String name,TreeSet ts,HashMap)
遍历TreeSet集合:获取每个人手机上的编号
再使用编号在hm集合寻找对应的值:get(K key)—>V value
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.TreeSet;
/*
* 模拟斗地主洗牌发牌,牌顺序有序
* */
public class PokerDemo2 {
public static void main(String[] args) {
//1)创建牌盒
HashMap<Integer, String> hm = new HashMap<Integer, String>();
ArrayList<Integer> array = new ArrayList<Integer>();
//2)装牌
//定义点数数组
String numbers[] = {"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
String[] colors = {"♥","♠","♣","♦"};
int index = 0;
//2.1)将点数数组和花色数组遍历,并且拼接
for(String number : numbers) {
for(String color : colors) {
String poker = color.concat(number);
//将编号以及牌添加HashMap集合中
hm.put(index, poker);
//将编号存储在ArrayList集合中
array.add(index);
index ++;
}
}
//System.out.println(array);
//2.2)给HashMap<Integer ,String>存储编号和牌
hm.put(index, "小王");
array.add(index);
index ++;
hm.put(index, "大王");
array.add(index);
//3)洗牌
Collections.shuffle(array);
//4)发牌
TreeSet<Integer> player1 = new TreeSet<Integer>() ;
TreeSet<Integer> player2 = new TreeSet<Integer>() ;
TreeSet<Integer> player3 = new TreeSet<Integer>() ;
TreeSet<Integer> diPai = new TreeSet<Integer>() ;
//遍历盒中的牌
for(int x = 0;x < array.size();x ++) {
//判断底牌以及三种情况
if(x >= array.size()-3) {
diPai.add(array.get(x)) ;
}else if(x % 3 == 0) {
//玩家1
player1.add(array.get(x)) ;
}else if(x %3 ==1) {
//玩家2
player2.add(array.get(x)) ;
}else if(x % 3 == 2) {
//玩家3
player3.add(array.get(x)) ;
}
}
//5)看牌
lookPoker("玩家1:",player1, hm);
lookPoker("玩家2:",player2,hm);
lookPoker("玩家3:",player3,hm);
lookPoker("底牌:",diPai,hm);
}
private static void lookPoker(String name,TreeSet<Integer> ts, HashMap<Integer, String> hm) {
System.out.print(name+ "的牌是:");
//遍历TreeSet集合获取编号
for(Integer key : ts) {
String value = hm.get(key);
System.out.print(value+" ");
}
System.out.println();
}
}