leetcode

0 class Solution {

1 vector<vector<int>> dp;

2

3 int solve(const string &s1, const string &s2, int i, int j) {

4 if (i == s1.size() && j == s2.size()) return 0;

5 if (i == s1.size() || j == s2.size()) return max(s1.size() - i, s2.size() - j);

6 if (dp[i][j] != INT_MAX) return dp[i][j];

7 if (s1[i] == s2[j]) return solve(s1, s2, i + 1, j + 1);

8 return dp[i][j] = 1 + min(solve(s1, s2, i + 1, j), solve(s1, s2, i, j + 1));

9 }

10

11 public:

12 int minDistance(const string &word1, const string &word2) {

13 dp.resize(size(word1) + 1, vector<int>(size(word2) + 1, INT_MAX));

14 return solve(word1, word2, 0, 0);

15 }

16 };