思路:遍历str1,先匹配第一个,如果不相同,跳过,继续寻找,如果相同,截取和str2相同长度的子串,比较是否相同,如果相同,则返回,如果不同继续寻找,一直到str1到最后一个字符
-
package com.puhui.goosecard.web;
-
class GFG {
-
public static void main(String[] args) {
-
String str1 = "abceacmk32acmzq";
-
char[] chars1 = str1.toCharArray();
-
String str2 = "acm";
-
char[] chars2 = str2.toCharArray();
-
for (int i = 0; i < chars1.length; i++) {
-
if (chars1[i] != chars2[0]) {
-
continue;
-
-
}
-
String temp = str1.substring(i, i + str2.length());
-
if (temp.equalsIgnoreCase(str2)) {
-
System.out.print(i);
-
-
}
-
-
}
-
-
}
}
- --------------------- 本文来自 hanruikai 的CSDN 博客 ,全文地址请点击:https://blog.csdn.net/hanruikai/article/details/82803096?utm_source=copy