[LeetCode] Edit Distance

class Solution {
public:
int minDistance(string word1, string word2) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int m = word1.size();
int n = word2.size();

vector<vector<int> > dp(m + 1, vector<int>(n + 1));

for (int i = 1; i <= m; i++)
dp[i][0] = i;

for (int j = 1; j <= n; 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 - 1], min(dp[i][j - 1], dp[i - 1][j])) + 1;
}
}
}

return dp[m]
;
}
};