斗地主发牌案例

实现步骤：
①准备编号和牌组成的Map集合
②准备一副牌（54个编号）
③洗牌（打乱集合）
④发牌（遍历集合）
⑤排序（sort方法）
⑥ 向玩家转牌（以键找值）
⑦打印

public class TestDemo {
    public static void main(String[] args) {
        LinkedHashMap<Integer,String> map = new LinkedHashMap<>();
        String[] colors = {"♠", "♥", "♣", "♦"};
        String[] nums = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2"};
        int id = 1;
        for (String num : nums) {
            for (String color : colors) {
                String card = color + num;
                map.put(id, card);
                id++;
            }
        }
        map.put(53,"小S");
        map.put(54,"大S");
        ArrayList<Integer> cards = new ArrayList<>();
        for (int i = 1; i < 55; i++) {
            cards.add(i);
        }
        Collections.shuffle(cards);
        ArrayList<Integer> player1 = new ArrayList<>();
        ArrayList<Integer> player2 = new ArrayList<>();
        ArrayList<Integer> player3 = new ArrayList<>();
        ArrayList<Integer> dipai = new ArrayList<>();
        for (int i = 0; i < cards.size()-3; i++) {
            Integer card = cards.get(i);
            if (i % 3 == 0) {
                player1.add(card);
            } else if (i % 3 == 1) {
                player2.add(card);
            } else {
                player3.add(card);
            }
        }
        dipai.add(cards.get(53));
        dipai.add(cards.get(52));
        dipai.add(cards.get(51));

        Collections.sort(player1);
        Collections.sort(player2);
        Collections.sort(player3);
        Collections.sort(dipai);

        LookCards(player1,map);
        LookCards(player2,map);
        LookCards(player3,map);
        LookCards(dipai,map);
    }
    public static void LookCards(ArrayList<Integer> idcards,LinkedHashMap<Integer,String> map) {
        for (Integer idcard : idcards) {
            String card = map.get(idcard);
            System.out.print(card+" ");
        }
        System.out.println();
    }
}