思路分析

代码实现

package com.atguigu.kmp;/*** @创建人 wdl* @创建时间 2021/4/4* @描述*/
public class ViolenceMatch {public static void main(String[] args) {//测试暴力匹配算法String str1= "硅硅谷 尚硅谷你尚硅 尚硅谷你尚硅谷你尚硅你好";String str2="尚硅谷你尚硅你";int index = violenceMatch(str1, str2);System.out.println(index);}//暴力匹配算法实现public static int violenceMatch(String str1,String str2){char[] s1 = str1.toCharArray();char[] s2 = str2.toCharArray();int s1Len = s1.length;int s2Len = s2.length;int i=0;//i索引指向s1int j=0;//j索引指向s2while (i<s1Len&&j<s2Len){//保证匹配时，不越界if(s1[i]==s2[j]){//匹配OKi++;j++;}else {//没有匹配成功//如果失败i=i-(j-1);j=0;}}//判断是否匹配成功if(j==s2Len){return i-j;}else {return -1;}}
}