两个字符串,s1,s2
判断s1是否s2的所有字符
package 算法;
import java.util.Arrays;
public class 判断字符串数组包含 {
public static void main(String[] args) {
String s1 = "abcde";
String s2 = "abcpepyq";
boolean check = check(s1, s2);
if (check){
System.out.println("s2包含了s1");
}else {
System.out.println("s2没有包含s1");
}
}
public static boolean check(String s1, String s2) {
char[] s2_chars = s2.toCharArray();
Arrays.sort(s2_chars);
for (int i = 0; i < s1.length(); i++) {
char a = s1.charAt(i);
//使用二分查找
int index = Arrays.binarySearch(s2_chars, a);
if (index < 0)
return false;
}
return true;
}
}