POJ 1035 Spell checker(二)
}
}
if(j==l1)
{
cout<<" "<
}
}else if(l1-l2==1)
{
for(j=0,x=0;j<=l1-1;j++)
{
if(s1[i][j]!=s2[x]&&k==0)
{
k=1;
}else if(s1[i][j]!=s2[x])
{
break;
}else if(s1[i][j]==s2[x])
{
x++;
}
}
if(j==l1)
{