题解

#include<bits/stdc++.h>
using namespace std;
typedef long long apple;
typedef string pear; 
pear a,b;
int main(){
    cin>>a>>b;
    apple la=a.size(),lb=b.size();
    apple dp[la+10][lb+10];
    for(apple i=0;i<=la;i++) dp[i][0]=i;
    for(apple i=0;i<=lb;i++) dp[0][i]=i;
    for(apple i=1;i<=la;i++){
        for(apple j=1;j<=lb;j++){
            if(a[i-1]==b[j-1]) dp[i][j]=dp[i-1][j-1];
            else dp[i][j]=min(dp[i-1][j],min(dp[i][j-1],dp[i-1][j-1]))+1;
        }
    }
    cout<<dp[la][lb];
    return 0;
}