动态规划

最小编辑距离

https://zhuanlan.zhihu.com/p/80682302
https://leetcode.com/problems/edit-distance/submissions/

• 记忆化搜索

class Solution {
   
    int[][] mem;
    String s1;
    String s2;

    int recursion(int i, int j) {
   
        //base case
        if (i == -1) return j + 1;
        if (j == -1) return i + 1;
        //hit memory
        if (mem[i][j] != -1) return mem[i][j];
        int ret;
        if (s1.charAt(i) == s2.charAt(j)) {
   
             ret=recursion(i - 1, j - 1);
        } else {