在具有正则表达式的字符串中查找特殊字符串中的特殊字符串

Question

我有一个HashMap,里面有键和值。我想用字符串中映射的值替换键。

在字符串中，键被写成@keyname或@“keyname”，这些应替换为map.get（“keyname”）

假设我们的地图是这个

"key1" : "2"  
"key2" : "3"  
"key3" : "4"  
"key 4" : "5"
"key-5" : "6"

所以如果我们处理字符串“Hello world,Iam@key1 years old.”，它将变成“Hello world,Iam 2 years old.”。

我们可以用@“key1”代替@key1。如果我们不使用引号，则在键名后面应该有一个空白（空格字符）或EOF，键名中不应该有空白。但是如果键名中有一个空白，那么它应该在引号中。

如果我们处理字符串“Hello world,I am@”Key@“Key1”“years old.”，那么第一步它应该替换特殊字符串中的特殊字符串，变成“Hello world,I am@”Key2“years old.”第二步应该是“你好，世界，我3岁。”

我已经为一个特殊的字符串做过了，它不识别特殊字符串中的特殊字符串。代码如下：

private static Pattern specialStringPattern = Pattern.compile("@\"([^\"]*?)\"|@\\S+");

/** this replaces the keys inside a string with their values.
 * for example @keyName or @"keyName" is replaced with the value of the keyName. */
public static String specialStrings(String s) {
    Matcher matcher = specialStringPattern.matcher(s);
    while (matcher.find()) {
        String text = matcher.group();
        text = text.replace("@","").replaceAll("\"","");
        s = s.replace(matcher.group(),map.get(text));
    }
    return s;
}

对不起，我的英语，我缺乏正则表达式知识。我想只要稍微修改一下代码，就应该很容易得到答案。

下面是我需要的一些示例：

There is @key1 apples on the table.  
There is 2 apples on the table.

There is @"key1" apples on the table.  
There is 2 apples on the table.

There is @key 4 apples on the table.
There is null 4 apples on the table.

There is @"key 4" apples on the table.
There is 5 apples on the table.

There is @key@key2 apples on the table.
There is @key3 apples on the table. (second step)
There is 4 apples on the table. (final output)

There is @"key @"key3"" apples on the table.
There is @"key 4" apples on the table. (second step)
There is 5 apples on the table. (final output)

There is @"key @key3" apples on the table.
There is @"key 4" apples on the table. (second step)
There is 5 apples on the table. (final output)

There is @"key @key3 " apples on the table.
There is @"key 4 " apples on the table. (second step)
There is null apples on the table. (final output)

There is @key-5 apples on the table.
There is 6 apples on the table.

Answer 1

不使用正则表达式：

for (boolean hit = true; hit;) {
    hit = false;
    for (String key : map.keySet()) {
        if (str.contains("@\"" + key + "\"")) {
            str = str.replace("@\"" + key + "\"", map.get(key));
            hit = true;
        } else if (str.contains("@" + key  )) {
            str = str.replace("@" + key + "", map.get(key));
            hit = true;
        }
    }
}

Answer 2

我在这里创建了与您的示例相匹配的正则表达式:https://regex101.com/r/nudyel/2

@(\“[\w\s]+\”）（？！@(\w+)@(\w+))@(\w+)

您只需将函数修改为递归：

public static String specialStrings(String s) {
    Matcher matcher = specialStringPattern.matcher(s);
    boolean findAgain = false;
    while (matcher.find()) {
        String text = matcher.group();
        text = text.replace("@","").replaceAll("\"","");
        s = s.replace(matcher.group(),map.get(text));
        findAgain = true;
    }
    if (findAgain) return specialStrings(s);
    return s;
}

[更新]
正则表达式:https://regex101.com/r/nudyel/4

@(\“[\w\s-]+\”）（？！@([\w-]+)@([\w-]+))@([\w-]+)