Reluctant量词[X{n,m}?]匹配存在至少n
但不多于m
次的X
。
示例
以下示例显示了Reluctant量词的用法。
package com.yiibai;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class ReluctantQuantifierDemo {
private static final String REGEX = "T{2,3}?";
private static final String INPUT = "abcdTatTTfgfgTTTtrtetTTTTW";
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
Match String start(): 21
Match String start(): 23