0072.cpp

#include <iostream>
#include <vector>

using namespace std;

class Solution 
{
public:
    int minDistance(string word1, string word2) 
    {
        int len1 = word1.size(), len2 = word2.size();
        vector<vector<int>> dp(len1 + 1, vector<int>(len2 + 1, 0));
        for (int i = 1; i <= len1; i++)
            dp[i][0] = i;
        for (int j = 1; j <= len2; j++)
            dp[0][j] = j;
        for (int i = 1; i <= len1; i++)
        {
            for (int j = 1; j <= len2; j++)
            {
                if (word1[i - 1] == word2[j - 1])
                    dp[i][j] = dp[i - 1][j - 1];
                else
                    dp[i][j] = min(min(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]) + 1;
                //cout << dp[i][j] << " ";
            }
            //cout << endl;
        }
        return dp[len1][len2];
    }
};

int main()
{
    string word1 = "horse", word2 = "ros";

    Solution S;
    S.minDistance(word1, word2);

    return 0;
}