锤子剪刀布

最新推荐文章于 2021-08-07 20:00:15 发布

TIANHE_

最新推荐文章于 2021-08-07 20:00:15 发布

阅读量121

点赞数

分类专栏：新手上路

本文链接：https://blog.csdn.net/TIANHE_/article/details/107261810

版权

新手上路专栏收录该内容

102 篇文章 0 订阅

订阅专栏

import java.util.Scanner;
//锤子剪刀布
public class Main_071 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        //甲乙两人,以甲为记录,甲胜即乙负;
        int win = 0;
        int lose = 0;
        int equ = 0;
        int winC = 0;
        int winB = 0;
        int winJ = 0;
        int loseC = 0;
        int loseB = 0;
        int loseJ = 0;
        while (scanner.hasNext()) {
            int num = scanner.nextInt();
            //二维数组存甲乙两人手势
            String[][] in = new String[num][2];
            for (int i = 0; i < num; i++) {
                in[i][0] = scanner.next();
                in[i][1] = scanner.next();

                //甲出C的情况
                if (in[i][0].equals("C")) {
                    if (in[i][1].equals("C")) { //乙出C
                        equ++;
                    } else if (in[i][1].equals("J")) { //乙出J
                        win++;
                        winC++;
                    } else { //乙出B
                        lose++;
                        loseB++;
                    }
                 //甲出J
                } else if (in[i][0].equals("J")) {
                    if (in[i][1].equals("C")) {
                        lose++;
                        loseC++;
                    } else if (in[i][1].equals("J")) {
                        equ++;
                    } else {
                        win++;
                        winJ++;
                    }
                 //甲出B
                } else {
                    if (in[i][1].equals("C")) {
                        win++;
                        winB++;
                    } else if (in[i][1].equals("J")) {
                        lose++;
                        loseJ++;
                    } else {
                        equ++;
                    }
                }
            }
            //胜负平结果
            System.out.println(win + " " + equ + " " + lose);
            System.out.println(lose + " " + equ + " " + win);

            //甲赢的最多的手势
            if (winB >= winC && winB >= winJ) {
                System.out.print("B ");
            } else if (winC >= winJ) {
                System.out.print("C ");
            } else {
                System.out.print("J ");
            }

            //乙赢的最多的手势
            if (loseB >= loseC && loseB >= loseJ) {
                System.out.print("B");
            } else if (loseC >= loseJ) {
                System.out.print("C");
            } else {
                System.out.print("J");
            }

        }
    }
}