[算法]计算编辑距离

package algorithm;
public class EditDistance {

	private static int min(int x, int y, int z) {
		x = x < y ? x : y;
		x = x < z ? x : z;
		return x;
	}
	
	public static int distance(String str1, String str2) {
		if(str1 == null && str2 == null)
			return 0;
		if(str1 == null || str1.isEmpty() == true) {
			str1 = "";
			return str2.length();
		}
		if(str2 == null || str2.isEmpty() == true) {
			str2 = "";
			return str1.length();
		}
		char[] p = str1.toCharArray();
		char[] t = str2.toCharArray();
		int[][] D = new int[p.length][t.length];
		
		for(int i = 0, k = 1; i < p.length; i++) {
			if(t[0] == p[i])
				k = 0;
			D[i][0] = i + k;
		}
		for(int j = 0, k = 1; j < t.length; j++) {
			if(p[0] == t[j])
				k = 0;
			D[0][j] = j + k;
		}
		for(int i = 1; i < p.length; i++)
			for(int j = 1; j < t.length; j++) {
				int x = D[i - 1][j - 1] + (p[i] == t[j] ? 0 : 1);
				int y = D[i - 1][j] + 1;
				int z = D[i][j - 1] + 1;
				D[i][j] = min(x, y, z);
			}
		return D[p.length - 1][t.length - 1];
	}
	
	public static double calc(String str1, String str2) {
		int distance = distance(str1, str2);
		int len = str1.length() > str2.length() ? str1.length() : str2.length();
		return	(len - (double)distance) / len;
	}
	
	public static void main(String[] args) {
		String x="abcde";
		String y="acfdeg";
		System.out.println(distance(x,y));
	}
}