计算字符串相似度--dp

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int main()
{
    char strA[10] = "abddd";
    char strB[10] = "aebdd";
    int lenA, lenB;
    lenA=strlen(strA);
    lenB=strlen(strB);

    //dp
    int dp[lenA+1][lenB+1];
    for(int i=0; i<=lenA; i++)
    {
        for(int j=0; j<=lenB; j++)
        {
            dp[i][j] = lenA+lenB+1;
        }
    }
    dp[0][0] = 0;
    for(int i=0; i<lenA; i++)
    {
        for(int j=0; j<lenB; j++)
        {
            if(strA[i]==strB[j])
            {
                dp[i+1][j+1] = min(dp[i][j],min(dp[i+1][j],dp[i][j+1])+1);
            }
            else
            {
                dp[i+1][j+1] = min(dp[i][j],min(dp[i+1][j],dp[i][j+1]))+1;
            }
        }
    }
    cout<<dp[lenA][lenB]<<endl;
    return 0;
}