poj1035Spell checker（字符串模拟）

http://poj.org/problem?id=1035

以前做过很类似的  四种情况分开讨论

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char str[10010][20],cs[10010][20];
int kk[10010];
int judge1(char *x,char *y)
{
    int i,j,k=0;
    for(i = 0; i < strlen(x) ; i++)
    {
        if(x[i]!=y[i])
        k++;
    }
    if(k>1)
    return 0;
    return 1;
}
int judge2(char *x,char *y)
{
    int i,j=0,k=0,flag;
    for(i = 0; i <strlen(x)&&j<strlen(y);i++)
    {
        if(x[i]!=y[j])
        {
            k++;
            i--;
        }
        j++;
    }
    if(k>1)

    return 0;
    return 1;
}
int main()
{
    int i,j,k=0,g;
    char c[20];
    while(cin>>str[k])
    {
        if(strcmp(str[k],"#")==0)
        break;
        kk[k] = strlen(str[k]);
        k++;
    }
    int f = 0;
    while(cin>>c)
    {
        if(strcmp(c,"#")==0)
        break;
        int tk = strlen(c);
        g = 0;
        f=0;
        for(i = 0 ; i < k ; i++)
        {
            if(tk==kk[i])
            {
                if(strcmp(c,str[i])==0)
                {
                    f = 1;
                    break;
                }
                else
                if(judge1(c,str[i]))
                {
                    g++;
                    strcpy(cs[g],str[i]);
                }
            }
            if(tk+1==kk[i])
            {
                if(judge2(c,str[i]))
                {
                    g++;
                    strcpy(cs[g],str[i]);
                }
            }
            if(tk-1==kk[i])
            {
                if(judge2(str[i],c))
                {
                    g++;
                    strcpy(cs[g],str[i]);
                }
            }
        }
        if(f)
        {
            printf("%s is correct\n",c);
        }
        else
        {
            printf("%s:",c);
            for(i = 1 ; i <= g ; i++)
            printf(" %s",cs[i]);
            puts("");
        }
    }
    return 0;
}