int minDistance(char * word1, char * word2){
int len1=strlen(word1);
int len2=strlen(word2);
int dp[len1+1][len2+1];
for(int a=0;a<len1+1;a++){
dp[a][0]=a;
}
for(int a=0;a<len2+1;a++){
dp[0][a]=a;
}
for(int a=0;a<len1;a++){
for(int b=0;b<len2;b++){
if(word1[a]==word2[b]){
dp[a+1][b+1]=dp[a][b];
}
else{
int Record=dp[a][b]>dp[a+1][b]?dp[a+1][b]:dp[a][b];
dp[a+1][b+1]=(Record>dp[a][b+1]?dp[a][b+1]:Record)+1;
}
}
}
return dp[len1][len2];
}
力扣------ 编辑距离
最新推荐文章于 2024-02-17 21:06:32 发布