比较字符串列表和字符串以查找连续字符匹配的数量

Question

Im sure this has been done before, but what Im really trying to do is have a method that finds consecutive matches of characters for one string, within a set of multiple strings, with any matches less than 1 character match, not counting. (minimum of 2).

if the string to test with was "xx Audible 5", the following would be the result

1. Audible xxx-xxx-5051 NJ ----- Result:10 (matches 'Audible' and 'xx')
2. yy Audible ----- Result:8 (Audible)
3. Audible 5 xy ----- Result:9 (spaces count, so match is Audible 5)
4. Audible.com 5 ----- Result:7

Answer 1

Try this. This is not optimized but it works pretty well

static int FindMatch(string text, string pattern)
    {
        var total = 0;           
        for (int i = 0; i < pattern.Length; i++)
        {
            var max = 0;               
            for (int j = 2; j <= pattern.Length - i; j++)
            {
                var temp = pattern.Substring(i, j);
                if (text.Contains(temp))                   
                    if (max < temp.Length)                        
                        max = temp.Length; 
            }
            total += max;
            if (max > 0)
                i += max-1;
        }
        return total;
    }

• FindMatch("Audible xxx-xxx-5051 NJ", "xx Audible 5"); returns 10

• FindMatch("yy Audible", "xx Audible 5"); returns 8

• FindMatch("Audible 5 xy", "xx Audible 5"); returns 9
• FindMatch("Audible.com 5", "xx Audible 5"); returns 9 too and not 7 because as I understood in this example would fail space 5 " 5"