Leetcode72 edit Distance动态规划

题目描述：
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on a word:

Insert a character
Delete a character
Replace a character
Example 1:

Input: word1 = “horse”, word2 = “ros”
Output: 3
Explanation:
horse -> rorse (replace ‘h’ with ‘r’)
rorse -> rose (remove ‘r’)
rose -> ros (remove ‘e’)
Example 2:

Input: word1 = “intention”, word2 = “execution”
Output: 5
Explanation:
intention -> inention (remove ‘t’)
inention -> enention (replace ‘i’ with ‘e’)
enention -> exention (replace ‘n’ with ‘x’)
exention -> exection (replace ‘n’ with ‘c’)
exection -> execution (insert ‘u’)
这题的解题方法为动态规划，java代码如下：

class Solution {
    public int minDistance(String word1, String word2) {
        if(word1==null&&word2==null) return 0;
        if(word1==null||word1.length()==0){
            return word2.length();
        }else if(word2==null||word2.length()==0){
            return word1.length();
        }
        //带记事本的动态规划
        int[][] dp=new int[word1.length()][word2.length()];
        return dynamic(word1,word2,word1.length()-1,word2.length()-1,dp);
    }
    public int dynamic(String word1,String word2,int top,int down,int[][] dp){
        if(top==-1&&down==-1) return 0;
        if(top==-1) return down+1;
        if(down==-1) return top+1;
        if(dp[top][down]!=0) return dp[top][down];
        if(word1.charAt(top)==word2.charAt(down)){
            dp[top][down]=dynamic(word1,word2,top-1,down-1,dp);
            return dp[top][down];
        }else{
            int del=dynamic(word1,word2,top,down-1,dp)+1;
        int rep=dynamic(word1,word2,top-1,down-1,dp)+1;
        int add=dynamic(word1,word2,top-1,down,dp)+1;
        dp[top][down]=Math.min(Math.min(del,rep),add);
        return dp[top][down];
        }
    }
}