动态规划 - 编辑距离 - 两字符串集合重排序

public class StringAlignment {
    /**     * 两个字符串集合进行重排序，将相似的放置到相同位置     * @param leftList  左侧List Arrays.asList("班级", "姓名", "年级", "生日", "生生");     * @param rightList 右侧List Arrays.asList("学生姓名", "学生生日");     * @return  右侧的 rightList 不变，左侧的返回新的List集合  [姓名, 生日, 班级, 年级]     */    public static List<String> reOrderLeftList(List<String> leftList, List<String> rightList) {        if(leftList != null && rightList != null                && leftList.size() > 0 && rightList.size() > 0) {            List<String> orderedList = new ArrayList<>();            for(String right : rightList) {                Integer minValue = Integer.MAX_VALUE;                String minWord = null;                for(String left : leftList) {                    if(!orderedList.contains(left)) {                        int distinctInt = DistanceUtiil.editDistance(left, right);                        if(distinctInt < minValue) {                            minValue = distinctInt;                            minWord = left;                        }                    }                }                if(minWord != null) {                    orderedList.add(minWord);                }            }
            // leftList 有可能小于 rightList， 最后再把没加进来的加进来            for(String left : leftList) {                if(!orderedList.contains(left)) {                    orderedList.add(left);                }            }            return orderedList;        } else {            return leftList;        }    }
}