leetcode72---编辑距离

leetcode72—编辑距离题目链接

题目简述

输入: word1 string, word2 string
操作: 增加字符,删除字符,替换字符
输出: distance int

解题思路

动态规划解法:

m=len(word1)
n=len(word2)
dp[i][j]: word1的前i个字符变为word2的前j个字符的最小代价
dp[i][j]可由以下状态转移而来:
	dp[i][j-1]: 再增加一个字符word2[j]得到dp[i][j];
	dp[i-1][j]: 再删掉一个字符word1[i]得到dp[i][j];
	dp[i-1][j-1]: 
		如果word1[i]==word2[j],直接得到dp[i][j];
		否则将word1[i]替换为word2[j],得到dp[i][j]

复杂度分析:

• 时间复杂度: O(n*m)
• 空间复杂度: O(n*m)

优化:

• 空间优化 O(n*m) ->O(min(m,n)),代码展示O(n)

代码

JAVA版:

class Solution {
    public int minDistance(String word1, String word2) {
        if(word1 == null || word2 == null) return -1;
        int len1 = word1.length();
        int len2 = word2.length();
        if(len1 == 0) return len2;
        if(len2 == 0) return len1;
        int[][] dp = new int[len2 + 1][2];
        int flag = 1;
        for(int i = 0; i <= len2; i++) dp[i][0] = i;
        for(int i = 1; i <= len1; i++) {
            dp[0][flag] = i;
            for(int j = 1; j <= len2; j++) {
                dp[j][flag] = Math.min(dp[j - 1][flag],dp[j][1 - flag]) + 1;
                int tmp = word1.charAt(i - 1) == word2.charAt(j - 1) ? 0 : 1;
                dp[j][flag] = Math.min(dp[j][flag],dp[j - 1][1 - flag] + tmp);
            }
            flag = 1 - flag;
        }
        return dp[len2][1 - flag];
    }
}

GoLang版:(刚刚接触golang,还没养成golang的使用思维…

func minDistance(word1 string, word2 string) int {
    len1 := len(word1)
    len2 := len(word2)
    if len1 == 0 {
    	return len2
    }
    if len2 == 0 {
    	return len1
    }
    var dp [100000][2]int
    flag := 1
    for i := 0; i <= len2; i++ {
    	dp[i][0] = i
    }
    for i := 1; i <= len1; i++ {
    	dp[0][flag] = i
    	for j := 1; j <= len2; j++ {
    		dp[j][flag] = minInt(dp[j - 1][flag], dp[j][1 - flag]) + 1
    		tmp := 1
    		if word1[i - 1] == word2[j - 1] {
    			tmp = 0
    		}
    		dp[j][flag] = minInt(dp[j][flag],dp[j - 1][1 - flag] + tmp)
    	}
    	flag = 1 - flag
    }
    return dp[len2][1 - flag]
}
func minInt(a int, b int) int {
	if a < b {
		return a
	} else {
		return b
	}
}