题解 | #扑克牌大小#
扑克牌大小
https://www.nowcoder.com/practice/d290db02bacc4c40965ac31d16b1c3eb
import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class Main { /** * @param args */ public static void main(String[] args) { Scanner in = new Scanner(System.in); // 注意 hasNext 和 hasNextLine 的区别 while (in.hasNext()) { // 注意 while 处理多个 case String a = in.nextLine(); System.out.println(getMax(a)); } } private static String getMax(String a) { String[] all = { "3", "4", "5", "6", "7", "8", "9", "10", "J", "Q", "K", "A", "2", "joker", "JOKER" }; Map<String, Integer> map = new HashMap<>(); for (int i = 0; i < all.length; i++) { map.put(all[i], i); } String[] str = a.split("-"); String[] s1 = str[0].split(" "); String[] s2 = str[1].split(" "); int first = map.get(s1[0]); int second = map.get(s2[0]); // System.out.println(s1.length + "========" + first); // System.out.println(s2.length + "========" + second); if (str[0].equals("joker JOKER") || str[1].equals("joker JOKER")) { return "joker JOKER"; } if (s1.length != s2.length && s1.length != 4 && s2.length != 4) { return "ERROR"; } else if (s1.length == s2.length) { if (first > second) { return str[0]; } else { return str[1]; } } else if (s1.length == 4 && s2.length != 4) { return str[0]; } else { return str[1]; } } }