动态规划-编辑距离问题

#include <iostream>
#include <algorithm>
const int MAXLEN =100;
#define  Match 1
#define Insert 2
#define Delete 3

class EditDistance
{
typedef struct Cell
{
int cost;
int parant;
}cell_t;
public:
EditDistance()
{
memset(m,0,sizeof(int)*MAXLEN*MAXLEN);
for(int i=1;i!=MAXLEN;i++){

m[i][0].cost=i;
m[i][0].parant=Insert;
m[0][i].cost=i;
m[0][i].parant=Insert;
}
m[0][0].parant=-1;
}

//m[i][j]=min{m[i-1][j-1]+match(s[i],[j]),m[i][j-1]+1,m[i-1][j]+1}
int excute(char* s,char* t)
{
int opt[4];
int len_s=strlen(s);
int len_t=strlen(t);
for(int i=1;i!=len_s;i++){
for(int  j=1;j!=len_t;j++){
opt[Match]=m[i-1][j-1].cost+match(s[i],t[j]);
opt[Insert]=m[i][j-1].cost+1;
opt[Delete]=m[i-1][j].cost+1;
m[i][j].cost=std::min(std::min(opt[Match],opt[Insert]),opt[Delete]);
}
}
return m[len_s-1][len_t-1].cost;

}
~EditDistance()
{
}
private:
int match(char i,char j)
{
if(i==j){
return 0;
}
return 1;
}
cell_t m[MAXLEN][MAXLEN];
};

int main()
{
char s[]="asdffd";
char t[]="aedfad";
EditDistance distance;
int res=distance.excute(s,t);
std::cout<<res<<std::endl;
getchar();
}