skdoakdoakdpoakdpoakdpoakdpoakdpokpodkoapdkpoakdpakpdpkapdkpaodkpakdpkpdkadpkpaoodksaodaodddddksaopdoapkdpakdpoakdpokdkapodpadpakdpoakdopakdopkpoakdpapdkapdpadakdposaodpadpakdopakdpoakdpokpdkpakdopadkpakdkdkpadkakdpakdp
String test1 = "java java java. JAVA! ";
String test2 = "h w !!! ...";
String word ="java";
int count = 0;
String strArray[] = test2.split(" ");
for(int i=0; i < strArray.length; i++){
if (word.equals("java")) {
`enter code here`
count++;
}
System.out.println(strArray[i]);
}
System.out.println(count);
test1.toUpperCase() + test1.toLowerCase().concat;
count++;
test1.toLowerCase();
count++;
System.out.println(count);
如何在 Java 中返回不区分大小写的出现次数 我会在互联网上拖钓,但没有运气。在 JavaScript 中,我会使用,但在这里我是新手,所以请帮助。所以我需要找到上面建议的 java 不区分大小写的次数
希望这有帮助
String inputString = "java java java. JAVA!";
int counter = 0;
Pattern pattern = Pattern.compile("JAVA");
Matcher match = pattern.matcher(inputString.toUpperCase());
while (match.find()) {
counter++;
}
System.out.println(counter);
enter code here:
String regex = "JAVA";
String input = "Java java JAVA ss".toUpperCase();
Pattern p = Pattern.compile(regex);
Matcher m = p.matcher(input);
int count = 0;
List<Integer> index = new ArrayList<>();
while (m.find()) {
count++;
System.out.println("Match number: " + count);
System.out.println("start: " + m.start());
System.out.println("end: " + m.end());
index.add(m.start());
}
System.out.println("count: " + count);
System.out.println("index: " + index.toString());
第一次用这个,希望能帮到你。
为了良好的顺序:
Pattern pattern = Pattern.compile("java", Pattern.CASE_INSENSITIVE);
Matcher matcher = pattern.matcher(inputString);
int count = (int) matcher.results().count();
或短:
int count = Pattern.compile("java", Pattern.CASE_INSENSITIVE)
.matcher(inputString).results().count();