计算两个字符串的距离(相似度)

#define min(a,b) (((a)<(b)) ? (a) : (b))
int stringDistance(char strA[], int pABegin, int pAEnd, char strB[], int pBBegin, int pBEnd)
{
    if(pABegin > pAEnd){
        if(pBBegin > pBEnd) return 0;
        else return pBEnd - pBBegin + 1;
    }
    if(pBBegin > pBEnd){
        if(pABegin > pAEnd)return 0;
        else return pAEnd - pABegin + 1; 
    }
    if(strA[pABegin] == strB[pBBegin])
        return stringDistance(strA, pABegin+1, pAEnd, strB, pBBegin+1, pBEnd);
    else{
        int t1 =  stringDistance(strA, pABegin+1, pAEnd, strB, pBBegin, pBEnd);
        int t2 =  stringDistance(strA, pABegin, pAEnd, strB, pBBegin+1, pBEnd);
        int t3 =  stringDistance(strA, pABegin+1, pAEnd, strB, pBBegin+1, pBEnd);
        return min(t1, min(t2,t3)) + 1;   
    }
}

#define LEN  100
int dp[LEN][LEN];
int stringDistance2(char str1[], char str2[])
{
    int l1 = strlen(str1), l2 = strlen(str2);
    int e1 = l1-1, e2 = l2-1, i, j;
    
    for(i = e2; i>=0; --i)dp[e1+1][i] = l2-i;
    for(i = e1; i>=0; --i)dp[i][e2+1] = l1-i;
    
    for(i = e1; i >=0 ; --i){
        for(j = e2; j >= 0 ; --j){
            if(str1[i] == str2[j]) dp[i][j] = dp[i+1][j+1];
            else{
                dp[i][j] = min(dp[i+1][j], min(dp[i+1][j+1], dp[i][j+1])) + 1;
            }
        }
    }
    
    return dp[0][0];
}