question1:
/*
问题1:求S2在S1中出现的次数
s1=“abcabcbcacbabbabcba”
s2=“abc”
推荐算法:KMP算法
*/
public static void question1(){
/*
问题1:求s2在s1中出现的次数
s1="abcabcbcacbabbabcba"
s2="abc"
*/
String s1="12376128736123123612312312536123123";
String s2="12";
int count=0;
for(int i=0;i<s1.length()-s2.length()+1;i++){
String sub=s1.substring(i,i+s2.length());
if(sub.equals(s2)){
count++;
}
}
System.out.println("s2在s1中出现了"+count+"次");
}
question2:
/*
问题2:判断字符串s是否是回文
s="上海自来水来自海上"
*/