- 思想
在B串中查找A串,把B串中A[0]的位置都放到数组里面,此次从数组为之查找即可,成功返回true,否则返回false
- 代码
Java代码
import java.util.*;
public class F{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s1 = sc.next();
String s2 = sc.next();
int i = 0,j = 0,k = 0;
// 记录s2中s1[0]出现的位置
List<Integer> arr = new ArrayList<Integer>();
while(i < s2.length()){
if(s2.charAt(i) == s1.charAt(j)){
arr.add(i);
}
i++;
}
if(arr.size() > 0)
i = arr.get(k);
while(i < s2.length() && j < s1.length() && k < arr.size()) {
if(s2.charAt(i) == s1.charAt(j)){
i++;
j++;
}else {
k++;
if(k < arr.size() && arr.get(k) != null){
i = arr.get(k);
j = 0;
}else{
break;
}
}
}
if(j == s1.length())
System.out.println("true");
else
System.out.println("false");
}
}