【leetcode】String——Edit Distance（72）

题目：

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

思路：dp

用二维数组dp[i][j]表示 word1前i个char 转换到 word2前j个char的最短路径。

:word1第i个char记为ch1 ，word2第j个char记为ch2：

如果ch1==ch2：dp[i][j]=dp[i-1][j-1]

如果ch1!=ch2：dp[i][j] = Min{dp[i-1][j], dp[i][j-1], dp[i-1][j-1] }+1

代码：

public int minDistance(String word1, String word2) {
	int len1 = word1.length();
	int len2 = word2.length();
	
	int dp[][] = new int [len1+1][len2+1];
	
	//dp init
	for(int i=0;i<len1+1;i++)
		dp[i][0]=i;
	for(int j=0;j<len2+1;j++)
		dp[0][j]=j;
	
	
	//dp
	for(int i=1;i<=len1;i++){
		for(int j=1;j<=len2;j++){
			if(word1.charAt(i-1)==word2.charAt(j-1))
				dp[i][j]=dp[i-1][j-1];
			else{
				int min = Math.min(dp[i-1][j-1], dp[i][j-1]);
				min = Math.min(min, dp[i-1][j]);
				dp[i][j]=min+1;
			}
		}
	}
	
    return dp[len1][len2];
}