java string查找子串,在Java中查找字符串中出现的所有子字符串

I'm trying to find all occurrences of a substring in a string in Java.

For example:

searching "ababsdfasdfhelloasdf" for "asdf" would return [8,17] since there are 2 "asdf"'s, one at position 8 and one at 17.

Searching "aaaaaa" for "aa" would return [0,1,2,3,4] because there is an "aa" at positions 0,1,2,3, and 4.

I tried this:

public List findSubstrings(String inwords, String inword) {

String copyOfWords = inwords;

List indicesOfWord = new ArrayList();

int currentStartIndex = niwords.indexOf(inword);

int indexat = 0;

System.out.println(currentStartIndex);

while (cthing1 > 0) {

indicesOfWord.add(currentStartIndex+indexat);

System.out.println(currentStartIndex);

System.out.println(indicesOfWord);

indexat += cthing1;

copyOfWords = copyOfWords.substring(cthing1);

System.out.println(copyOfWords);

cthing1 = copyOfWords.indexOf(inword);

}

This problem can be solved in Python as follows:

indices = [m.start() for m in re.finditer(word, a.lower())]

where "word" is the word I'm looking for and "a" is the string I'm searching through.

How can I achieve this in Java?

解决方案

You can use capturing inside a positive look-ahead to get all overlapping matches and use Matcher#start to get the indices of the captured substrings.

As for the regex, it will look like

(?=(aa))

In Java code:

String s = "aaaaaa";

Matcher m = Pattern.compile("(?=(aa))").matcher(s);

List pos = new ArrayList();

while (m.find())

{

pos.add(m.start());

}

System.out.println(pos);

Result:

[0, 1, 2, 3, 4]