leetcode:编辑距离（java动态规划）

题目：

给定两个单词 word1 和 word2，计算出将 word1 转换成 word2 所使用的最少操作数 。
你可以对一个单词进行如下三种操作：
插入一个字符
删除一个字符
替换一个字符
示例 1:
输入: word1 = "horse", word2 = "ros"
输出: 3
解释:
horse -> rorse (将 'h' 替换为 'r')
rorse -> rose (删除 'r')
rose -> ros (删除 'e')
示例 2:
输入: word1 = "intention", word2 = "execution"
输出: 5
解释:
intention -> inention (删除 't')
inention -> enention (将 'i' 替换为 'e')
enention -> exention (将 'n' 替换为 'x')
exention -> exection (将 'n' 替换为 'c')
exection -> execution (插入 'u')

public class MinDistance {
    public int minDistance(String word1, String word2) {
        if (word1.equals("") && word2.equals("")) return 0;
        if (word1.equals("") && !word2.equals("")) return word2.length();
        if (!word1.equals("") && word2.equals("")) return word1.length();
        int[][] dp = new int[word1.length()+1][word2.length()+1];
      /*  if (word1c[0] == word2c[0]) {
            dp[0][0] = 0;
        } else {
            dp[0][0] = 1;
        }*/
        for (int i = 0; i <= word1.length(); i++) {
            dp[i][0] = i;
        }
        for (int i = 0; i <= word2.length(); i++) {
            dp[0][i] = i;
        }
        for (int i = 1; i <= word1.length(); i++) {
            for (int j = 1; j <= word2.length(); j++) {
                if (word1.charAt(i-1) == word2.charAt(j-1)) {
                    dp[i][j] =dp[i - 1][j - 1];
                } else {
                    dp[i][j] = Math.min(dp[i - 1][j] + 1, Math.min(dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1));
                }
            }
        }
        for (int i = 0; i < dp.length; i++) {
            for (int j = 0; j < dp[0].length; j++) {
                System.out.print(dp[i][j]);
            }
            System.out.println();
        }
        return dp[word1.length() ][word2.length()];
    }

    public static void main(String[] args) {
        MinDistance a = new MinDistance();
        System.out.println(a.minDistance("sea"
                ,"eat"));
    }
}