java 锤子剪刀布(20)-优快云博客

本文链接：https://blog.youkuaiyun.com/KEVIN_WANG333/article/details/107254471

本文展示了一个使用Java实现的游戏对战逻辑代码示例。通过读取用户输入，判断两个玩家之间的胜负，并更新每个玩家的胜利、平局、失败次数及各招式使用次数。代码涉及Java的Scanner类用于获取用户输入，HashMap用于存储各招式的使用次数。

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

在这里插入图片描述

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Question1 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        Model mA = new Model();
        Model mB = new Model();
        for(int i = 0; i < n;i++) {
            String a = scanner.next();
            String b = scanner.next();
            judge(a, b, mA, mB);
        }
        System.out.println(mA.win + " " + mA.draw + " " + mA.lose);
        System.out.println(mB.win + " " + mB.draw + " " + mB.lose);
        System.out.println(getMostGen(mA.map) + " " + getMostGen(mB.map));
    }

    private static String getMostGen(Map<String, Integer> map) {
        if(map.get("C") >= map.get("J") ) {
            if(map.get("C") > map.get("B")) {
                return "C";
            } else{
                return "B";
            }
        } else{
            if(map.get("J") > map.get("B")) {
                return "J";
            } else {
                return "B";
            }
        }
    }
    private static void judge(String a, String b, Model mA, Model mB) {
        if (a.equals("J")) {
            if (b.equals("J")) {
                mA.draw++;
                mB.draw++;
            } else if (b.equals("B")) {
                mA.win++;
                mB.lose++;
                mA.map.put("J", mA.map.get("J") + 1);
            } else {
                mA.lose++;
                mB.win++;
                mB.map.put("C", mB.map.get("C") + 1);
            }
        } else if (a.equals("C")) {
            if (b.equals("J")) {
                mA.win++;
                mB.lose++;
                mA.map.put("C", mA.map.get("C") + 1);
            } else if (b.equals("B")) {
                mA.lose++;
                mB.win++;
                mB.map.put("B", mA.map.get("B") + 1);
            } else {
                mA.draw++;
                mB.draw++;
            }
        } else if (a.equals("B")) {
                if (b.equals("J")) {
                    mA.lose++;
                    mB.win++;
                    mB.map.put("J", mA.map.get("J") + 1);
                } else if (b.equals("B")) {
                    mA.draw++;
                    mB.draw++;
                } else {
                    mA.win++;
                    mB.lose++;
                    mA.map.put("B", mA.map.get("B") + 1);
                }
        }
    }
    static class Model {
        int win;
        int draw;
        int lose;
        Map<String,Integer> map = new HashMap<>();

        public Model() {
            map.put("J", 0);
            map.put("B", 0);
            map.put("C", 0);
        }
    }
}