贪心量词[X{n,}
]匹配至少出现n次的X.
示例
以下示例显示了贪婪量词的用法。
package com.yiibai;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class GreedyQuantifierDemo {
private static final String REGEX = "T{2,}";
private static final String INPUT = "abcdTatTTfgfgTTTW";
public static void main(String[] args) {
// create a pattern
Pattern pattern = Pattern.compile(REGEX);
// get a matcher object
Matcher matcher = pattern.matcher(INPUT);
while(matcher.find()) {
//Prints the start index of the match.
System.out.println("Match String start(): "+matcher.start());
}
}
}
编译并运行上面的程序,这将产生以下结果 -
Match String start(): 7
Match String start(): 13