模糊查询的算法
private void Button1_Click(object sender, System.EventArgs e)
{
//public void checkuser(string userpost,string checkpost)
//{
string userpost=TextBox1.Text;
string checkpost=TextBox2.Text;
int postlen=userpost.Length;
int checkpostlen=checkpost.Length;
bool zz=false;
int i_count=0;
for(int i=0;i<postlen-2;i++)
{
i_count=i_count+1;
if (zz==true)
{
break;
}
if(userpost[i].CompareTo(checkpost[0])==0)
{
for(int k=0;k<checkpostlen-1;k++)
{
i_count=i_count+1;
if(userpost[i+1].CompareTo(checkpost[k+1])==0||userpost[i+2].CompareTo(checkpost[k+1])==0)
{
zz=true;
}
else
{
zz=false;
break;
}
}
}
}
if(zz==true)
{
Response.Write("FUCK");
}
else
{
Response.Write("ok");
}
TextBox3.Text=postlen.ToString();
TextBox4.Text=i_count.ToString();
}
以上算法可能不算太好,但是觉得比某些人的算法好吧.他们别自认为有多高...所谓人外有人...他们的算法在我看来还不是垃圾一堆
{
//public void checkuser(string userpost,string checkpost)
//{
string userpost=TextBox1.Text;
string checkpost=TextBox2.Text;
int postlen=userpost.Length;
int checkpostlen=checkpost.Length;
bool zz=false;
int i_count=0;
for(int i=0;i<postlen-2;i++)
{
i_count=i_count+1;
if (zz==true)
{
break;
}
if(userpost[i].CompareTo(checkpost[0])==0)
{
for(int k=0;k<checkpostlen-1;k++)
{
i_count=i_count+1;
if(userpost[i+1].CompareTo(checkpost[k+1])==0||userpost[i+2].CompareTo(checkpost[k+1])==0)
{
zz=true;
}
else
{
zz=false;
break;
}
}
}
}
if(zz==true)
{
Response.Write("FUCK");
}
else
{
Response.Write("ok");
}
TextBox3.Text=postlen.ToString();
TextBox4.Text=i_count.ToString();
}