解题思路:参考别人的思路
注意事项:定义字符串来排序,contains()来匹配,注意两牌相等也是NO
参考代码:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String []str={"A","2","3","4","5","6","7","8","9","10","J","Q","K"};
int N=scanner.nextInt();
int a=0;
int c=0;
for(int i=1;i<=N;i++){
String king=scanner.next();
String str1=scanner.next();
String str2=scanner.next();
for(int j=0;j<=12;j++){
if(str1.contains(str[j]))
{ a=j;
break;}
}
for(int k=0;k<=12;k++){
if(str2.contains(str[k]))
{ c=k;
break;}
}
if(str1.contains(king)&&!str2.contains(king))
System.out.println("YES");
else if(str1.contains(king)&&str2.contains(king)&&a>c)
System.out.println("YES");
else if(!str1.contains(king)&&!str2.contains(king)&&a>c)
System.out.println("YES");
else
System.out.println("NO");
}
}
}
0.0分
1 人评分
矩阵转置 (C语言代码)浏览:1526 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:644 |
C语言程序设计教程(第三版)课后习题9.2 (Java代码)浏览:638 |
A+B for Input-Output Practice (VI) (C++代码)浏览:418 |
DNA (C语言描述,数据结构)浏览:862 |
C语言程序设计教程(第三版)课后习题6.1 (C语言代码)浏览:702 |
K-进制数 (C语言描述,蓝桥杯)浏览:925 |
核桃的数量 (C语言代码)浏览:672 |
C语言程序设计教程(第三版)课后习题11.8 (C语言代码)浏览:697 |
The 3n + 1 problem (C语言代码)浏览:505 |