68、采用HashMap（双列表）实现斗地主发牌

采用HashMap实现斗地主
一、方式：
    1、用一个ArrayList集合存储每张牌的序号index
    2、用一个HashMap集合存储键值对，键为index,值为牌面
    3、洗牌采用将ArrayList集合的index序号打乱。
    4、发牌也是给每个人建立ArrayList集合，再将上面ArrayList集合中的index分发给各个新建的ArrayList集合。
    5、看牌就使用每个人的ArrayList集合中的index作为键去获取HashMap里面的值。

import java.util.*;

public class Example09 {
    public static void main(String[] args) {
        List<String> colors = List.of("♠","♥","♦","♣");
        List<String> numbers = List.of("2","A","K","Q","L","10","9","8","7","6","5","4","3");

        HashMap<Integer, String> pork = new HashMap<>();
        pork.put(0,"大王");
        pork.put(1,"小王");

        //建立一个List作为pork的key键
        List<Integer> keySn = new ArrayList<>();
        keySn.add(0);
        keySn.add(1);
        int index = 2;
        for (String number : numbers) {//这个循环要放外面，要不然不能排序
            for (String color : colors) {
                pork.put(index,color + number);
                keySn.add(index);
                index++;
            }
        }
        /*for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 13; j++) {
                String s = colors.get(i);
                String s1 = numbers.get(j);
                pork.put(2+j+i*13,s+s1);

                keySn.add(j+i*13);
            }
        }*/
        System.out.println("准备好牌");
        System.out.println(pork);

        //建立一个List作为pork的key键
      /*List<Integer> keySn =  List.of(0,1,2,3,4,5,6,7,8,9,10,
                11,12,13,14,15,16,17,18,19,20,
                21,22,23,24,25,26,27,28,29,30,
                31,32,33,34,35,36,37,38,39,40,
                41,42,43,44,45,46,47,48,49,50,
                51,52,53);*///直接这样，后面调用shuffle会出错，不知道为啥？

        //洗牌
         Collections.shuffle(keySn);
        System.out.println("洗牌之后顺序");
       System.out.println(keySn);

        //发牌
        ArrayList<Integer> user1 = new ArrayList<>();
        ArrayList<Integer> user2 = new ArrayList<>();
        ArrayList<Integer> user3 = new ArrayList<>();
        ArrayList<Integer> dipai = new ArrayList<>();

        for (int i = 0; i < 54 ; i++) {
            Integer integer = keySn.get(i);
            if (integer >= 51){//底牌
                dipai.add(integer);
            }
            else if(integer%3 == 0){
                user1.add(integer);
            }
            else if(integer%3 == 1){
                user2.add(integer);
            }
            else {
                user3.add(integer);
            }
        }

        //玩家牌进行排序
        Collections.sort(user1);
        Collections.sort(user2);
        Collections.sort(user3);
        Collections.sort(dipai);
        System.out.println("各玩家的牌---排序后");
        System.out.println("====================================");
        lookPork("刘德华：",pork, user1);
        lookPork("周星驰：",pork, user2);
        lookPork("周润发：",pork, user3);
        lookPork("底牌：",pork, dipai);
    }

    public static void lookPork(String name, HashMap<Integer,String> pork, List<Integer> list)
    {
        System.out.print(name+":");

        for (Integer i : list) {
            String s = pork.get(i);
            System.out.print(s + " ");
        }
        System.out.println();
    }
}

输出：

准备好牌
{0=大王, 1=小王, 2=♠2, 3=♥2, 4=♦2, 5=♣2, 6=♠A, 7=♥A, 8=♦A, 9=♣A, 10=♠K, 11=♥K, 12=♦K, 13=♣K, 14=♠Q, 15=♥Q, 16=♦Q, 17=♣Q, 18=♠L, 19=♥L, 20=♦L, 21=♣L, 22=♠10, 23=♥10, 24=♦10, 25=♣10, 26=♠9, 27=♥9, 28=♦9, 29=♣9, 30=♠8, 31=♥8, 32=♦8, 33=♣8, 34=♠7, 35=♥7, 36=♦7, 37=♣7, 38=♠6, 39=♥6, 40=♦6, 41=♣6, 42=♠5, 43=♥5, 44=♦5, 45=♣5, 46=♠4, 47=♥4, 48=♦4, 49=♣4, 50=♠3, 51=♥3, 52=♦3, 53=♣3}
洗牌之后顺序
[30, 40, 32, 46, 37, 35, 26, 11, 45, 48, 28, 17, 51, 39, 25, 41, 53, 36, 10, 43, 38, 29, 6, 14, 50, 7, 22, 5, 20, 44, 24, 18, 4, 49, 12, 1, 33, 15, 34, 8, 42, 3, 0, 27, 21, 52, 31, 19, 2, 13, 16, 47, 23, 9]
各玩家的牌---排序后
====================================
刘德华：:大王 ♥2 ♠A ♣A ♦K ♥Q ♠L ♣L ♦10 ♥9 ♠8 ♣8 ♦7 ♥6 ♠5 ♣5 ♦4 
周星驰：:小王 ♦2 ♥A ♠K ♣K ♦Q ♥L ♠10 ♣10 ♦9 ♥8 ♠7 ♣7 ♦6 ♥5 ♠4 ♣4 
周润发：:♠2 ♣2 ♦A ♥K ♠Q ♣Q ♦L ♥10 ♠9 ♣9 ♦8 ♥7 ♠6 ♣6 ♦5 ♥4 ♠3 
底牌：:♥3 ♦3 ♣3