最短编辑距离与编辑距离

最短编辑距离

具体代码如下

#include<iostream>

using namespace std;

const int N = 1010;

int n, m;
char a[N], b[N];
int f[N][N];

int main(){
    
    cin >> n >> a + 1 >> m >> b + 1;
    
    for(int i = 1; i <= n; ++ i) f[i][0] = i;
    for(int i = 1; i <= m; ++ i) f[0][i] = i;
    
    for(int i = 1; i <= n; ++ i)
        for(int j = 1; j <= m; ++ j){
            f[i][j] = min(f[i - 1][j], f[i][j - 1]) + 1;
            f[i][j] = min(f[i][j], f[i - 1][j - 1] + (a[i] != b[j]));
        }
        
    cout << f[n][m] << endl;
    
    return 0;
}

编辑距离
编辑距离就是求几次最短编辑距离，分析过程都相同
具体代码如下

#include<iostream>
#include<cstring>

using namespace std;

const int N = 15, M = 1010;

int n, m;
char str[M][N];
int f[N][N];

int edit_limit(char a[], char b[]){
    int la = strlen(a + 1), lb = strlen(b + 1);
    
    for(int i = 1; i <= la; ++ i) f[i][0] = i;
    for(int i = 1; i <= lb; ++ i) f[0][i] = i;
    
    for(int i = 1; i <= la; ++ i)
        for(int j = 1; j <= lb; ++ j){
            f[i][j] = min(f[i - 1][j], f[i][j - 1]) + 1;
            f[i][j] = min(f[i][j], f[i - 1][j - 1] + (a[i] != b[j]));
        }
    return f[la][lb];
}

int main(){
    
    cin >> n >> m;
    
    for(int i = 0; i < n; ++ i) cin >> str[i] + 1;
    
    while(m --){
        
        char op[N];
        int limit;
        cin >> op + 1 >> limit;
        
        int res = 0;
        for(int i = 0; i < n; ++ i)
            if(edit_limit(str[i], op) <= limit)
                res ++;
        cout << res << endl;
    }
    
    return 0;
}