华为od机试题目-斗地主之顺子

原创已于 2025-08-08 01:21:10 修改 · 242 阅读

5 ·

CC 4.0 BY-SA版权

文章标签：

#java #算法 #前端

于 2025-08-08 01:17:07 首次发布

public static void main(String[] args) {
//       输入 2 9 J Q 3 4 K A 7 10 A 5 6
        Scanner sc = new Scanner(System.in);
        String[] str= sc.nextLine().replaceAll("2","").trim().split("\\s+");
        //自定义排序
        Arrays.sort(str,(a,b)->EqualValue(a)-EqualValue(b));
        //判断是否能连成顺子
        int count = 1;
        //判断是否有顺子
        int judge = 0;
        for (int i = 1; i < str.length-3; i++) {
            StringBuilder stringBuilder = new StringBuilder();
            stringBuilder.append(str[i-1]);
            for (int j = i; j < str.length; j++) {
                if (EqualValue(str[j])!=EqualValue(str[j-1])+1){
                    if (count>=5){
                        System.out.println(stringBuilder.toString());
                    }
                    count=1;i=j;judge=1;
                    break;
                }else {
                    stringBuilder.append(str[j]);
                    count++;
                }
            }
        }
        if (judge==1){
            System.out.println("NO");
        }
    }
    private static int EqualValue(String num){
        switch (num){
            case "3":return 3;
            case "4":return 4;
            case "5":return 5;
            case "6":return 6;
            case "7":return 7;
            case "8":return 8;
            case "9":return 9;
            case "10":return 10;
            case "J":return 11;
            case "Q":return 12;
            case "K":return 13;
            case "A":return 14;
        }
        return 0;
    }