正则表达式：匹配仅包含非重复单词的字符串

Question

我有这种情况（Java代码）： 1）字符串如：“狂野冒险”应匹配。 2）带有相邻重复单词的字符串：“野性狂野冒险”不应该匹配。

使用这个正则表达式：。* \ b（\ w +）\ b \ s * \ 1 \ b。*我可以匹配包含相邻重复单词的字符串。

如何扭转这种情况，即如何匹配不包含相邻重复词的字符串

Answer 1

使用否定先行断言(?!pattern)。

    String[] tests = {
        "A wild adventure",      // true
        "A wild wild adventure"  // false
    };
    for (String test : tests) {
        System.out.println(test.matches("(?!.*\\b(\\w+)\\s\\1\\b).*"));
    }

由Rick Measham's explain.pl提供的解释：

REGEX: (?!.*\b(\w+)\s\1\b).*
NODE                     EXPLANATION
--------------------------------------------------------------------------------
  (?!                      look ahead to see if there is not:
--------------------------------------------------------------------------------
    .*                       any character except \n (0 or more times
                             (matching the most amount possible))
--------------------------------------------------------------------------------
    \b                       the boundary between a word char (\w)
                             and something that is not a word char
--------------------------------------------------------------------------------
    (                        group and capture to \1:
--------------------------------------------------------------------------------
      \w+                      word characters (a-z, A-Z, 0-9, _) (1
                               or more times (matching the most
                               amount possible))
--------------------------------------------------------------------------------
    )                        end of \1
--------------------------------------------------------------------------------
    \s                       whitespace (\n, \r, \t, \f, and " ")
--------------------------------------------------------------------------------
    \1                       what was matched by capture \1
--------------------------------------------------------------------------------
    \b                       the boundary between a word char (\w)
                             and something that is not a word char
--------------------------------------------------------------------------------
  )                        end of look-ahead
--------------------------------------------------------------------------------
  .*                       any character except \n (0 or more times
                           (matching the most amount possible))

另见

• regular-expressions.info/Lookarounds

相关问题

• using regular expression in Java
  • 使用负向前瞻以确保字符串不会出现多次出现的字符
• Java split is eating my characters.
  • 许多使用断言的例子
• How do I convert CamelCase into human-readable names in Java?
  • 使用外观的非常有启发性的例子

---

注意

负面断言只有在你想要积极匹配的其他模式时才有意义（参见上面的例子）。否则，您可以使用布尔补码运算符!来否定matches之前使用的任何模式。

String[] tests = {
    "A wild adventure",      // true
    "A wild wild adventure"  // false
};
for (String test : tests) {
    System.out.println(!test.matches(".*\\b(\\w+)\\s\\1\\b.*"));
}