| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/feixiangcode/algorithm/master/Week_04/id_102/leetcode_72_102.cpp | [Back] [Original] |
class Solution {
public:
int minDistance(string word1, string word2) {
int row = word1.size();
int column = word2.size();
int f[row+1][column+1];
for (int i = 0; i
| Web Proxy Viewer | New URL | Original Page |