By default,pattern matching is greedy,which means that the matcher returns the longest match possible. For example,applying the patternA.*c
toAbcAbcA
matchesAbcAbc
rather than the shorterAbc
. To do nongreedy matching,a question mark must be added to the quantifier. For example,the patternA.*?c
will find the shortest match possible.
// Greedy quantifiers String match = find("A.*c","AbcAbc"); // AbcAbc match = find("A.+","AbcAbc"); // AbcAbc // Nongreedy quantifiers match = find("A.*?c","AbcAbc"); // Abc match = find("A.+?","AbcAbc"); // Abc // Returns the first substring in input that matches the pattern. // Returns null if no match found. public static String find(String patternStr,CharSequence input) { Pattern pattern = Pattern.compile(patternStr); Matcher matcher = pattern.matcher(input); if (matcher.find()) { return matcher.group(); } return null; }
注:本文转载自:http://www.zsm8.com/book/java_Exa/java.util.regex/Greedy.html
原文地址:https://www.jb51.cc/regex/362827.html
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。