一副扑克去掉大小王，随机抽取5张，判断是不是顺子_从一副不含大小王的牌组中随机抽出7张牌,判断7张牌中是否存在顺子牌型,即是否存在-优快云博客

本文链接：https://blog.youkuaiyun.com/weixin_45399731/article/details/105417280

本文介绍了一种用于识别扑克牌游戏中同花顺及普通顺子牌型的算法实现。通过无限循环发牌，算法检查每手牌是否构成同花顺或顺子，并打印相应的牌型信息。该算法使用Java编写，通过Map存储牌面信息和牌型判断结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

public class PuKePai {

    public static void main(String[] args) {
        new Thread(() -> {
            for (; ; ) {
                Map<String, Object> builder = builder();
                boolean isTongHuaShun = (boolean) builder.get("isTongHuaShun");
                List<Integer> puKePaiList = (List<Integer>) builder.get("puKePai");
                boolean flag = false;

                in:
                for (int i = 0; i < puKePaiList.size() - 1; i++) {
                    if (puKePaiList.get(i + 1) != puKePaiList.get(i) + 1) {
                        flag = true;
                        break in;
                    }
                }

                if (flag) {
                    // 测试时可以注释掉下面这行
                    // System.out.println(builder + "不是顺子");
                } else if (isTongHuaShun) {
                    System.out.println(builder + "是同花顺");
                } else {
                    System.out.println(builder + "是普通顺子");
                }
            }
        }, "无限发牌").start();
    }

    /**
     * 发牌
     *
     * @return
     */
    public static Map<String, Object> builder() {
        List<Integer> puKePaiList = new ArrayList<>(5);
        // 当size() == 1时表示是同花
        Set<Integer> colorSet = new HashSet<>(16);
        
        do {
            // 取随机数并不合理,会导致样本数量变大
            Integer numberOfPuKe = (int) (Math.random() * 13 + 1);
            colorSet.add((int) (Math.random() * 4 + 1));
            if (!puKePaiList.contains(numberOfPuKe)) {
                puKePaiList.add(numberOfPuKe);
            } else if (puKePaiList.stream().filter(e -> e.equals(numberOfPuKe)).count() < 4) {
                puKePaiList.add(numberOfPuKe);
            }
        } while (puKePaiList.size() <= 4);
        
        Collections.sort(puKePaiList);
        
        Map<String, Object> map = new HashMap<>(16);
        map.put("isTongHuaShun", colorSet.size() == 1 ? true : false);
        map.put("puKePai", puKePaiList);
        return map;
    }
}