class Solution { public: int minDistance(string word1, string word2) { vector<vector<int> > f(word1.size()+1, vector<int>(word2.size()+1)); f[0][0] = 0; for(int i = 1; i <= word2.size(); i++) f[0][i] = i; for(int i = 1; i <= word1.size(); i++) f[i][0] = i; for(int i = 1; i <= word1.size(); i++) for(int j = 1; j <= word2.size(); j++) { f[i][j] = INT_MAX; if (word1[i⑴] == word2[j⑴]) f[i][j] = f[i⑴][j⑴]; f[i][j] = min(f[i][j], f[i⑴][j⑴] + 1); //replace f[i][j] = min(f[i][j], min(f[i⑴][j], f[i][j⑴]) + 1); //delete or insert } return f[word1.size()][word2.size()]; } };