9-25每日一题：583. 两个字符串的删除操作

583. 两个字符串的删除操作

class Solution {
public:
    int minDistance(string s1, string s2) {
        int n = s1.size(), m = s2.size();
        vector<vector<int>> f(n + 1, vector<int>(m + 1));
        s1 = ' ' + s1, s2 = ' ' + s2;
        for (int i = 1; i <= n; i ++ ) f[i][0] = i;
        for (int j = 1; j <= m; j ++ ) f[0][j] = j;

        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= m; j ++ ) {
                if (s1[i] == s2[j]) f[i][j] = f[i - 1][j - 1];
                else f[i][j] = min(f[i - 1][j], f[i][j - 1]) + 1;
            }
        return f[n][m];  
    }
};