正确答案:
import java.util.Scanner;
public class Main{
/**
*
* 判断短字符串中的所有字符是否在长字符串中全部出现
*/
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String sshort = scanner.nextLine();
String slong = scanner.nextLine();
System.out.println(haschar(sshort, slong));
}
public static boolean haschar(String sshort, String slong) {
int longlength = slong.length();
int shortlength = sshort.length();
if (longlength < shortlength) {
return false;
}
int[] wordcount = new int[256];
for (int i = 0; i < 256; i++) {
wordcount[i] = 0;
}
for (int i = 0; i < longlength; i++) {
wordcount[slong.charAt(i)]++;
}
for (int i = 0; i < shortlength; i++) {
if (wordcount[sshort.charAt(i)] == 0) {
return false;
}
}
return true;
}
}
上面是别人的代码,下面是我的代码,有错误,但不知道错哪了
import java.util.Scanner;
public class MatchString {
/**
*
* 判断短字符串中的所有字符是否在长字符串中全部出现
*/
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String str1 = scan.next();
String str2 = scan.next();
System.out.println(matchString(str1,str2));
}
private static boolean matchString(String str1, String str2) {
int count = 0;
int check = 0;
if(str1.length()> str2.length())
return false;
for (int i = 0; i < str1.length(); i++) {
for (int j = 0; j < str2.length(); j++) {
if(str1.charAt(i) == str2.charAt(j))
check++;
}
if(check > 0)
count++;
}
if(count == str1.length())
return true;
else
return false;
}
}