题解 | 编辑距离(二)

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * min edit cost
     * @param str1 string字符串 the string
     * @param str2 string字符串 the string
     * @param ic int整型 insert cost
     * @param dc int整型 delete cost
     * @param rc int整型 replace cost
     * @return int整型
     */
    int minEditCost(string str1, string str2, int ic, int dc, int rc) {
        // write code here
        int n = str1.size(), m = str2.size();
        vector<int> prev(m + 1), cur(m + 1);
        rc = min(rc, ic + dc);
        for (int j = 0; j <= m; j++) prev[j] = j * ic;
        for (int i = 1; i <= n; i++) {
            cur[0] = i * dc;
            for (int j = 1; j <= m; j++) {
                int cost = str1[i - 1] == str2[j - 1] ? 0 : rc;
                cur[j] = min({cur[j - 1] + ic, prev[j - 1] + cost, prev[j] + dc});
            }
            swap(cur, prev);
        }
        return prev[m];
    }
};