List&TreeSet实现斗地主发牌及牌序

方式一

第一种方式没有实现牌的常规排序。

思路见代码

 public static void main(String[] args) {
        //创建一个牌盒子
        List<String> list = new ArrayList<>();
        String[] hs = {"♥", "♣", "♦", "♠"};
        String[] z = {"2", "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A"};
        String[] w = {"大王", "小王"};
        for (int i = 0; i < hs.length; i++) {
            for (int j = 0; j < z.length; j++) {
                list.add(hs[i] + z[j]);
            }
        }
        for (int i = 0; i < w.length; i++) {
            list.add(w[i]);
        }
        //System.out.println(list);

        //模拟洗牌的过程
        Collections.shuffle(list);
//        System.out.println(list);
        List<String> G = new ArrayList<>();
        List<String> C = new ArrayList<>();
        List<String> T = new ArrayList<>();
        List<String> DP = new ArrayList<>();
        //模拟发牌
        for (int i = 0; i < list.size(); i++) {
            if (i < 3) {
                DP.add(list.get(i));
            } else if (i % 3 == 0) {
                G.add(list.get(i));
            } else if (i % 3 == 1) {
                C.add(list.get(i));
            } else if (i % 3 == 2) {
                T.add(list.get(i));
            }
        }

        //看牌
        System.out.println(LookPoker(G, "高帅"));
        System.out.println(LookPoker(C, "蔡鹏瑞"));
        System.out.println(LookPoker(T, "田永平"));
        System.out.println(LookPoker(DP, "底牌"));

    }

    public static String LookPoker(List<String> list, String name) {
        System.out.print(name + "的牌是:");
        StringBuilder s = new StringBuilder();
        s.append("[");
        for (int i = 0; i < list.size(); i++) {
            if (i != list.size() - 1) {
                s.append(list.get(i)).append(", ");
            } else {
                s.append(list.get(i)).append("]");
            }
        }

        return s.toString();
    }

方式二（实现排序）

思路:

1. 用hashMap存储（Interger,String）存储的是，牌号（0-53）表示，value是对应的真实牌

2. 用一个list存储牌号（0-53），模拟洗牌的时候实质是洗牌号。

3. 发牌，每个人的牌用一个TreeSet存储，会实现自动排序

代码

 public static void main(String[] args) {
        //存放一副完整的扑克牌
        Map<Integer, String> map = new HashMap<>();
        //存放map中的索引，洗牌的时候实质是在洗索引，方便之后用TreeSet排序。
        List<Integer> list = new ArrayList<>();
        String[] colors = {"♣", "♠", "♦", "♥"};
        String[] number = {"3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2"};

        Integer k = 0;
        for (int i = 0; i < number.length; i++) {
            for (int j = 0; j < colors.length; j++) {
                map.put(k, colors[j] + number[i]);
                list.add(k);
                k++;
            }
        }
        map.put(k, "小王");
        list.add(k);
        list.add(k + 1);
        map.put(k + 1, "大王");

        //System.out.println(map);
        //模拟洗牌过程
        Collections.shuffle(list);

        TreeSet<Integer> G = new TreeSet<>();
        TreeSet<Integer> T = new TreeSet<>();
        TreeSet<Integer> C = new TreeSet<>();
        TreeSet<Integer> DP = new TreeSet<>();
        for (int i = 0; i < list.size(); i++) {
            if (i > list.size() - 4) {
                DP.add(list.get(i));
            } else if (i % 3 == 0) {
                G.add(list.get(i));
            } else if (i % 3 == 1) {
                T.add(list.get(i));
            } else if (i % 3 == 2) {
                C.add(list.get(i));
            }
        }
        LookPoker(G, "高帅", map);
        LookPoker(T, "田永平", map);
        LookPoker(C, "蔡鹏瑞", map);
        LookPoker(DP, "底牌", map);
    }

    public static void LookPoker(TreeSet<Integer> TreeSet, String name, Map<Integer, String> map) {
        System.out.print(name + "的牌是:");
        for (Integer integer : TreeSet) {
            System.out.print(map.get(integer) + "  ");
        }
        System.out.println();
    }