【leetcode】第72题 Edit Distance 题目+解析+JAVA代码

【题目】

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)

You have the following 3 operations permitted on a word:

a) Insert a character
b) Delete a character
c) Replace a character

【解析】

这道题意是，输入两个字符串，将第一个变换为第二个，可以插入一个字符，删除一个字符或替换一个字符，这三个操作都算执行了一步。

选择使用动态规划解答。

【代码】

public int minDistance(String word1, String word2) {
        int m = word1.length(), n=word2.length();
        int[][] cost = new int[m+1][n+1];
        for(int i=0;i