本文介绍了一种Java实现的字符串子串匹配算法，通过将输入字符串转换为字符数组并进行循环比较来判断目标子串是否存在。
package Interview;
public class SubString {
public static void main(String args[])
{
System.out.println(SubString.judge("sddddgdgassdg", "ss"));
}
public static boolean judge(String s1,String s2)
{
char[] s1char= s1.toCharArray();
char[] s2char = s2.toCharArray();
for(int i = 0;i<s1char.length-s2char.length;i++)
{
boolean temp = true;
for(int j = 0;j<s2char.length;j++)
{
if(s1char[i+j]!=s2char[j])
{
temp = false;
break;
}
}
if(temp)
{
return true;
}
}
return false;
}
public class SubString {
public static void main(String args[])
{
System.out.println(SubString.judge("sddddgdgassdg", "ss"));
}
public static boolean judge(String s1,String s2)
{
char[] s1char= s1.toCharArray();
char[] s2char = s2.toCharArray();
for(int i = 0;i<s1char.length-s2char.length;i++)
{
boolean temp = true;
for(int j = 0;j<s2char.length;j++)
{
if(s1char[i+j]!=s2char[j])
{
temp = false;
break;
}
}
if(temp)
{
return true;
}
}
return false;
}
}
运行结果如下图
扫一扫
646
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
