这是根据北大詹卫东老师的PPT,实现的编辑距离算法,如有错误,欢迎指出,我会做出及时修改。
package test;
//最小编辑距离的算法动态规划实现
public class Min_Edit_Distance {
private static int cost = 0;
public static int minEdit_distance(String source, String target)
{
final int n = target.length();
final int m = source.length();
if(m == 0 )return m;
if(n == 0)return n;
int[][] distance_matrix = new int[m+1][n+1];
distance_matrix[0][0] = 0;