DP基本问题

要明白DP数组的含义，即前i/j个字符的字符串编辑距离

递推公式的含义

以及dp数组的初始化

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int minDistance(string word1,string word2){
    int m = word1.size();
    int n = word2.size();
    vector<vector<int>> dp(m+1,vector<int>(n+1,0));
    for(int i = 0; i <= n; ++i) dp[i][0] = i;//初始化dp数组
    for(int j = 0; j <= m; ++j) dp[0][j] = j;
    for(int i = 1; i <= m; ++i){
        for(int j = 1; j <= n; ++j){
            if(word1[i-1]==word2[j-1]){
                dp[i][j] = dp[i-1][j-1];
            }
            else{
                dp[i][j] = min({dp[i-1][j],dp[i][j-1],dp[i-1][j-1]}) +1;
            }
        }
    }
    return dp[m][n];
}
int main() {
    string A,B;
    getline(cin,A);
    getline(cin,B);
    int res = minDistance(A,B);
    cout << res;
    return 0;
}