I am using two string for a matching program like this:
string s1= 5-4-6-+1-+1+1+3000+12+21-+1-+1-+1-+2-3-4-5-+1-+10+1-+1-+;
string s2= 6-+1-+1+1+3000+12+21-+1-+1-+1-+1-+1-+1+1-+1-+;
as inputs. And I am going to write a Regex matching function which compare each part string between each "+" separately and calculate match percent which is number of matching occurred in each string. For example in this example we have these matching:
6
1
1
1
3000
12
21
1
1
--
1
--
1
1
Currently I am using the below function, but I think it is not optimized and using Regex may be faster.
public double MatchPercent(string s1, string s2)
{
User = s1.Split('+').ToArray();
Policy = s2.Split('+').ToArray();
for (int i = 0; i < s1.Length - 2; i++)
{
int[] U = User.Split('-').Where(a => a != "").Select(n => Convert.ToInt32(n)).Distinct().ToArray();
int[] P = Policy.Split('-').Where(a => a != "").Select(n => Convert.ToInt32(n)).Distinct().ToArray();
var Co = U.Intersect(P);
if (Co.Count() > 0)
{
percent += 1;
}
}
return Math.Round((percent) * 100 / s1.Length );
}
