我需要找出一个字符串包含另一个字符串的百分比或字符数。
我尝试过Levenshtein Distance算法,但该算法返回的是使字符串相等所需更改的字符数。
有人可以帮忙吗?
我需要使用C#编写,但这并不重要。
答案代码: public double LongestCommonSubsequence(string s1, string s2) { //如果任一字符串为空,则长度必须为0 if (String.IsNullOrEmpty(s1) || String.IsNullOrEmpty(s2)) return 0; }
答案代码: public double LongestCommonSubsequence(string s1, string s2) { //如果任一字符串为空,则长度必须为0 if (String.IsNullOrEmpty(s1) || String.IsNullOrEmpty(s2)) return 0; }
int[,] num = new int[s1.Length, s2.Length]; //2D array
char letter1;
char letter2;
//Actual algorithm
for (int i = 0; i < s1.Length; i++)
{
letter1 = s1[i];
for (int j = 0; j < s2.Length; j++)
{
letter2 = s2[j];
if (letter1 == letter2)
{
if ((i == 0) || (j == 0))
num[i, j] = 1;
else
num[i, j] = 1 + num[i - 1, j - 1];
}
else
{
if ((i == 0) && (j == 0))
num[i, j] = 0;
else if ((i == 0) && !(j == 0)) //First ith element
num[i, j] = Math.Max(0, num[i, j - 1]);
else if (!(i == 0) && (j == 0)) //First jth element
num[i, j] = Math.Max(num[i - 1, j], 0);
else // if (!(i == 0) && !(j == 0))
num[i, j] = Math.Max(num[i - 1, j], num[i, j - 1]);
}
}//end j
}//end i
return (s2.Length - (double)num[s1.Length - 1, s2.Length - 1]) / s1.Length * 100;
} //end LongestCommonSubsequence