regex - 如何制作一个正则表达式来匹配模式之间带有随机点的字符串？

Question

我想将一个字符串与一部分模式进行比较，看看是否存在点之间的模式变化:
functin看起来像这样:

patterns := []string{"cat", "fish", "dog"}
func HasBadPattern(word string, patterns []string) bool {       
    for _, p := range patterns {
        myRegex, err := regexp.Compile(p)
        if err != nil {
            log.Println(err)
        }
        //Don't know how to perpare the wordToCompile ?
        matched := myRegex.FindString(wordToCompile)
        if len(matched) > 0 {
            return true
            break
        }
    }
    return false
}

结果应该是这样的:

HasBadPattern("c.at", patterns) //true
HasBadPattern("c.a.t", patterns) //true
HasBadPattern("c.a..t", patterns) //true
HasBadPattern("fis.h", patterns) //true
HasBadPattern("catfish", patterns) //false
HasBadPattern("here is the cat.", patterns) //false
HasBadPattern("cat is on the mat.", patterns) //false
HasBadPattern("cat.fish", patterns) //false

我的问题是如何准备ocht_code以便为字符之间的点编译而不会产生误报。
Here is the playground scaffolding

Answer 1

看来您基本上是想在字符串的字符之间插入\.*(零个或多个句点)。例如，"c.at"，"c.a.t"和"c.a..t"都由表达式^\.*c\.*a\.*t\.*$匹配。
可以使用类似(不是最有效的...)的函数来完成:

func randomDots(word string) string {
    dots := "\\.*"
    expression := fmt.Sprintf("^%s", dots)

    for i := range word {
        expression += fmt.Sprintf("%c%s", word[i], dots)
    }
    expression += "$"
    return expression
}

然后，您可以将HasBadPattern更改为:

func HasBadPattern(word string, patterns []string) bool {
    for _, p := range patterns {
        expression := randomDots(p)
        myRegex, _ := regexp.Compile(expression)
        matched := myRegex.FindString(word)
        if len(matched) > 0 {
            return true
        }
    }
    return false
}