题解 | #计算某字符出现次数#
计算某字符出现次数
https://www.nowcoder.com/practice/a35ce98431874e3a820dbe4b2d0508b1
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
int count = 0;
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str1= br.readLine();
String str2= br.readLine();
String[] arr1 = str1.toUpperCase().split("");
String[] arr2 = str2.toUpperCase().split("");
for (int i = 0; i < str1.length(); i++) {
for (int j = 0; j < str2.length(); j++) {
// System.out.println("arr1[" + i + "]" + arr1[i] + "\n" + "arr2[" + j + "]" + arr2[j]);
if(arr1[i].equals(arr2[j])) {
count++;
}
}
}
//System.out.println("字母" + str2 + "出现的次数是:" + count);
System.out.println(count);
}
}
#华为OD##华为机考#
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
int count = 0;
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str1= br.readLine();
String str2= br.readLine();
String[] arr1 = str1.toUpperCase().split("");
String[] arr2 = str2.toUpperCase().split("");
for (int i = 0; i < str1.length(); i++) {
for (int j = 0; j < str2.length(); j++) {
// System.out.println("arr1[" + i + "]" + arr1[i] + "\n" + "arr2[" + j + "]" + arr2[j]);
if(arr1[i].equals(arr2[j])) {
count++;
}
}
}
//System.out.println("字母" + str2 + "出现的次数是:" + count);
System.out.println(count);
}
}
#华为OD##华为机考#