📅 最后修改于: 2020-11-14 10:21:32 🧑 作者: Mango
勉强的量词指示搜索引擎以尽可能短的字符串。找到匹配项后，引擎继续；否则，它将一个字符添加到要检查的字符串部分并进行搜索，依此类推。此过程一直进行到找到匹配项或整个字符串用完为止。以下是在Java中使用正则表达式的“不情愿量词”的各种示例。
| Sr.No | Construct & Matches |
|---|---|
| 1 | X??
X, once or not at all. |
| 2 | X*?
X, zero or more times |
| 3 | X+?
X, one or more times. |
| 4 | X{n}?
X, exactly n times. |
| 5 | X{n,}?
X, at least n times. |
| 6 | X{n,m}?
X, at least n but not more than m times |