编辑距离算法比较两个字符串内容不同

package com.dl.util;

/**
 * 标记前后内容不同
 */
public class StringHighLightDifferentUtil {

    /**
         * 得到标记的字符串
         */
    public static String[] getMark(String a, String b) {
        String[] temp = getTempString(a, b);
        String[] result = {getMarking(a, temp[0], 1), getMarking(b, temp[1], 2)};
        return result;
    }

    /**
     * 比较源字符串和目标字符串，目标字符串字符为空格时，源字符串对应字符打上相应的标记符号
     */
    private static String getMarking(String source, String temp, Integer in) {
        StringBuffer sb = new StringBuffer();
        char[] sourceChars = source.toCharArray();
        char[] tempChars = temp.toCharArray();
        boolean flag = false;
        for (int i = 0; i < sourceChars.length; i++) {
            if (tempChars[i] == ' ') {
                if (i == 0) {
                    sb.append("<span>").append(sourceChars[i]==' '?"</span><span>":sourceChars[i]);
                } else if (flag) {
                    sb.append(sourceChars[i]==' '?"</span> <span>":sourceChars[i]);
                } else {
                    sb.append("<span>").append(sourceChars[i]==' '?"</span> <span>":sourceChars[i]);
                }
                flag = true;
                if (i == sourceChars.length - 1) {
                    sb.append("</span>");
                }
            } else if (flag == true) {
                sb.append("</span>").append(sourceChars[i]==' '?"</span> <span>":sourceChars[i]);
                flag = false;
            } else {
                sb.append(sourceChars[i]==' '?"</span> <span>":sourceChars[i]);
            }
        }
        //System.out.println("sb..."+sb.toString());
        if (in == 2) {
            return sb.toString();
        } else {
            return sb.toString().replace("<span>", "<a>").replaceAll("</span>","</a>");
        }
    }


    public static int[][] getLevenshteinDistance(CharSequence s, CharSequence t) {
        if (s == null || t == null) {
            throw new IllegalArgumentException("Strings must not be null");
        }
        int distance[][] = new int[s.length() + 1][t.length() + 1];

        for (int i = 0; i < s.length() + 1; ++i) {
            distance[i][0] = i;
        }

        for (int j = 1; j < t.length() + 1; ++j) {
            distance[0][j] = j;
        }

        int cost = 0;
        for (int i = 1; i < s.length() + 1; ++i) {
            for (int j = 1; j < t.length() + 1; ++j) {
                int tempCost = Math.min(distance[i - 1][j] + 1, distance[i][j - 1] + 1);
                if (s.charAt(i - 1) == t.charAt(j - 1)) {
                    cost = 0;
                } else {
                    cost = 1;
                }
                distance[i][j] = Math.min(distance[i - 1][j - 1] + cost, tempCost);
            }

        }
        return distance;
    }

    /**
     * 将两个字符串不同部分设为空格
     */
    private static String[] getTempString(String s, String t) {
        int[][] distance = getLevenshteinDistance(s, t);
        int i = distance.length - 1, j = distance[0].length - 1;
        int minDistance = distance[i][j];
        String sTemp = s;
        String tTemp = t;
        while (i > 0 && j > 0) {
            if (distance[i][j - 1] + 1 == minDistance) {
                //此时为s字符串i位置增加字符，t字符串j位置删除字符
                tTemp = tTemp.substring(0, j - 1) + " " + tTemp.substring(j);
                minDistance = distance[i][j - 1];
                j -= 1;
            } else if (distance[i - 1][j] + 1 == minDistance) {
                //此时为t字符串i位置增加字符，s字符串j位置删除字符
                sTemp = sTemp.substring(0, i - 1) + " " + sTemp.substring(i);
                minDistance = distance[i - 1][j];
                i -= 1;
            } else if (distance[i - 1][j - 1] + 1 == minDistance) {
                //此时为s字符串和t字符串在i，j位置替换字符
                sTemp = sTemp.substring(0, i - 1) + " " + sTemp.substring(i);
                tTemp = tTemp.substring(0, j - 1) + " " + tTemp.substring(j);
                minDistance = distance[i - 1][j - 1];
                i -= 1;
                j -= 1;
            } else {
                //此时s字符串t字符串在i，j位置字符相等
                i -= 1;
                j -= 1;
            }

        }

        while (i > 0) {

            sTemp = sTemp.substring(0, i - 1) + " " + sTemp.substring(i);
            minDistance = distance[i - 1][j];
            i -= 1;
        }

        while (j > 0) {
            tTemp = tTemp.substring(0, j - 1) + " " + tTemp.substring(j);
            minDistance = distance[i][j - 1];
            j -= 1;
        }
        String[] result = {sTemp, tTemp};
        return result;
    }

}