题目:
输入第1行给出正整数N(<=105),即双方交锋的次数。随后N行,每行给出一次交锋的信息,即甲、乙双方同时给出的的手势。C代表“锤子”、J代表“剪刀”、B代
表“布”,第1个字母代表甲方,第2个代表乙方,中间有1个空格。
输出描述:
输出第1、2行分别给出甲、乙的胜、平、负次数,数字间以1个空格分隔。第3行给出两个字母,分别代表甲、乙获胜次数最多的手势,中间有1个空格。如果解不唯
一,则输出按字母序最小的解。
源码:
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNextLine()) {
String s1 = in.nextLine();
int N = Integer.parseInt(s1);
Map<Character, Integer> map1 = new HashMap<>();
Map<Character, Integer> map2 = new HashMap<>();
char[] temp;
for (int i = 0; i < N; i++) {
String s = in.nextLine();
temp = s.trim().toCharArray();
// System.out.println(temp[0] + "," + temp[2]);
judge(temp, map1, map2);
}
char maxA = helper2(map1);
char maxB = helper2(map2);
int c1 = map1.getOrDefault('C', 0);
int j1 = map1.getOrDefault('J', 0);
int b1 = map1.getOrDefault('B', 0);
int c2 = map2.getOrDefault('C', 0);
int j2 = map2.getOrDefault('J', 0);
int b2 = map2.getOrDefault('B', 0);
int same = N - c1 - j1 - b1 - c2 - b2 - j2;
System.out.println((c1+b1+j1) + " " + same + " " + (c2+j2+b2));
System.out.println((c2+b2+j2) + " " + same + " " + (c1+b1+j1));
System.out.println(maxA + " " + maxB);
}
}
private static char helper2(Map<Character, Integer> map1) {
char res = 0;
int C = map1.getOrDefault('C', 0);
int J = map1.getOrDefault('J', 0);
int B = map1.getOrDefault('B', 0);
int max = 0;
char tmp = 0;
boolean isJ = false;
if (J > B) {
max = J;
tmp = 'J';
isJ = true;
} else {
max = B;
tmp = 'B';
}
if (isJ) {
if (max <= C) {
res = 'C';
} else {
res = tmp;
}
} else {
if (max < C) {
res = 'C';
} else {
res = tmp;
}
}
return res;
}
public static void judge
(char[] temp, Map<Character,Integer> map1, Map<Character,Integer> map2) {
if (temp[0] == temp[2]) {
return;
} else if (temp[0] == 'C' && temp[2] == 'J') {
map1.put('C', map1.getOrDefault('C', 0) + 1);
} else if (temp[0] == 'J' && temp[2] == 'C') {
map2.put('C', map2.getOrDefault('C', 0) + 1);
} else if (temp[0] == 'C' && temp[2] == 'B') {
map2.put('B', map2.getOrDefault('B', 0) + 1);
} else if (temp[0] == 'B' && temp[2] == 'C') {
map1.put('B', map1.getOrDefault('B', 0) + 1);
} else if (temp[0] == 'J' && temp[2] == 'B') {
map1.put('J', map1.getOrDefault('J', 0) + 1);
} else if (temp[0] == 'B' && temp[2] == 'J') {
map2.put('J', map2.getOrDefault('J', 0) + 1);
}
}
}