算法1
问题描述:一张纸上,写下一个字符串,判断正面和背面看到的字符串是否一样,注意字符是必须左右对称,比如W就是,N就不是
输入输出:
输入:
ABA
AHA
HHA
输出:
NO
YES
NO
思路:先统计都有啥字符,如果存在本身不对称的直接就返回false了,接着还要判断对应位置上的是否对称即可。
为啥用JAVA了,因为这个题目是暑期实习做过的,比较熟悉。【全A】
import java.util.HashSet;
import java.util.Scanner;
public class sol_360_2 {
public static HashSet<Character> book;
public static boolean check(String s){
for (int i=0;i<s.length();i++){
char c = s.charAt(i);
if (!book.contains(c)){
return false;
}
}
for (int i=0;i<s.length();i++){
if (s.charAt(i) != s.charAt(s.length()-1-i)){
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
book = new HashSet<>();
book.add('A');
book.add('H');
book.add('I');
book.add('M');
book.add('O');
book.add('T');
book.add('U');
book.add('V');
book.add('W');
book.add('X');
book.add('Y');
while (scan.hasNext()){
if (check(scan.nextLine())){
System.out.println("YES");
}else {
System.out.println("NO");
}
}
}
}
算法2 不及格的小A
问题描述:给定三张单词表,主语、谓语、宾语单词表,规定:谓语有且仅有一个单词,主语和宾语可以包含任意单词,不保证通顺,只要满足上面条件即可;现在给m条句子,判断是否符合
输入输出:
输入:
3 3 3 [每一个情况里面的个数]
i you he
am is he
yours his hers
5 [需要判断的语句]
i am yours
you is his
he are hers yours
i am am yours
is his
输出:
YES
YES
YES
NO
NO
思路:因为又不考虑顺序,按照个数一点点统计就好了 【全A】
import java.util.HashSet;
import java.util.Scanner;
public class Sol_360 {
public static boolean check(int[] arr){
int flag = -1;
int n = arr.length;
for (int i=0;i<n;i++){
if(arr[i] == 1){
if (flag != -1){
return false;
}
else {
flag = i;
}
}
}
if(flag == -1){
return false;
}
if (flag == 0){
return false;
}
for (int i=0;i<flag;i++){
if (arr[i] != 0){
return false;
}
}
for (int i=flag+1;i<n;i++){
if (arr[i] != 2){
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int[]n = new int[3];
for (int i=0;i<3;i++){
n[i] = scan.nextInt();
}
HashSet<String>[] book = new HashSet[3];
for (int i=0;i<3;i++){
book[i] = new HashSet<>();
}
for (int i=0;i<3;i++){
for (int j=0;j<n[i];j++){
book[i].add(scan.next());
}
}
int m = scan.nextInt();
scan.nextLine();
while (m-- != 0){
String[] s = scan.nextLine().split(" ");
int word_num = s.length;
int[] tag = new int[word_num];
for (int i=0;i<word_num;i++){
for (int j=0;j<3;j++){
if (book[j].contains(s[i])){
tag[i] = j;
}
}
}
if(check(tag)){
System.out.println("YES");
}else {
System.out.println("NO");
}
}
}
}