单列集合Collection和双列集合 Map实现扑克牌游戏

    @Test
    public void pokerGame(){
        String[] num={"3","4","5","6","7","8","9","10","J","Q","K","A","2"};
        String[] face={"红桃","黑桃","方块","梅花"};
        HashMap<Integer,String> poker = new HashMap<>();
        ArrayList<Integer> list=new ArrayList<>();
        int index=0;
        for(String s1:num) {
            for (String s2 : face) {
                poker.put(index, s2.concat(s1));
                list.add(index);
                index++;
            }
        }
        poker.put(index++,"小王");
        list.add(index);
        poker.put(index++,"大王");
        list.add(index);
        //2. 洗牌
        Collections.shuffle(list);
        System.out.println(list);
        //3. 发牌
        TreeSet<Integer> you = new TreeSet<>();
        TreeSet<Integer> me = new TreeSet<>();
        TreeSet<Integer> she = new TreeSet<>();
        TreeSet<Integer> dipai = new TreeSet<>();
        for (int i=0;i<list.size();i++){
            if(i>=list.size()-3){
                dipai.add(list.get(i));
            }else if(i%3==0){
                you.add(list.get(i));
            }else if(i%3==1){
                me.add(list.get(i));
            }else {
                she.add(list.get(i));
            }
        }

        lookPoker(poker,you,"你");
        lookPoker(poker,me,"我");
        lookPoker(poker,she,"她");
        lookPoker(poker,dipai,"底牌");

    }
    public static void lookPoker(HashMap<Integer,String> hashMap,TreeSet<Integer> treeSet,String name){
        System.out.println(name+"的牌是：");
        for (Integer i:treeSet) {
            System.out.print(hashMap.get(i)+",");
        }
        System.out.println();
    }