标签：
Edit Distance
问题：
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 class Solution { public int minDistance(String word1, String word2) { if(word1==null && word2==null) return 0; if(word1 == null) return word2.length(); if(word2 == null) return word1.length(); int m = word1.length(); int n = word2.length(); int[][] dp = new int[m+1][n+1]; for(int i=0; i<=m; i++) dp[i][0] = i; for(int j=0; j<=n; j++) dp[0][j] = j; for(int i=1; i<=m ;i++) { for(int j=1; j<=n; j++) { if(word1.charAt(i-1)==word2.charAt(j-1)) dp[i][j] = dp[i-1][j-1]; else { dp[i][j] = 1 + Math.min(Math.min(dp[i-1][j],dp[i][j-1]), dp[i-1][j-1]); } } } return dp[m][n]; } }
学习之处：
标签：
原文地址：http://www.cnblogs.com/sunshisonghit/p/4491956.html
