模拟斗地主代码

public class CollectionsDemo02 {
    public static void main(String[] args) {
        //创建集合对象
        HashMap<Integer, String> hm = new HashMap<>();
//创建数组,存储编号
        ArrayList<Integer> code = new ArrayList<>();
        int index = 0;
        //创建花色和点数数组
        String[] colors = {"♥", "♠", "♦", "♣"};
        String[] numbers = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "k", "A", "2"};

        for (String color : colors) {
            for (String number : numbers) {
                hm.put(index, color + number);
                code.add(index);
                index++;
            }
        }
        //大小王
        hm.put(index, "小王");
        code.add(index);
        index++;
        hm.put(index, "大王");
        code.add(index);


//洗牌
        Collections.shuffle(code);

        //发牌
        TreeSet<Integer> player1 = new TreeSet<>();
        TreeSet<Integer> player2 = new TreeSet<>();
        TreeSet<Integer> player3 = new TreeSet<>();
        TreeSet<Integer> dipai = new TreeSet<>();
        for (int i = 0; i < code.size(); i++) {
            int x = code.get(i);
            if (i > code.size() - 4) {
                dipai.add(x);
            } else if (i % 3 == 0) {
                player1.add(x);
            } else if (i % 3 == 1) {
                player2.add(x);
            } else {
                player3.add(x);
            }

        }
        //调用方法
        lookPoker("林青霞", player1, hm);
        lookPoker("张曼玉", player2, hm);
        lookPoker("风清扬", player3, hm);
        lookPoker("底牌", dipai, hm);

    }

    //看牌
    public static void lookPoker(String name, TreeSet<Integer> ts, HashMap<Integer, String> hm) {
        System.out.println(name + "的牌是");
        for (Integer key : ts) {
            String poker = hm.get(key);
            System.out.print(poker);
        }
        System.out.println();
    }
}

HashMap练习