快手实习生机试题 字符串最小变换次数

分析：

       动态规划，dp[ i ][ j ] 存储a[0]到a[ i ] 与b[0]到b[ j ] 两个字符串的最少变换次数(ab为字符数组),状态转移方程为

dp[i][j] = min(dp[i-1][j]+1 , dp[i][j-1]+1 , dp[i-1][j-1]+(a[i]==b[j]?0:1) );

代码：

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {// 注意，如果输入是多个测试用例，请通过while循环处理多个测试用例
            String a = in.next();
            String b = in.next();
            System.out.println(minDistance(a,b));
        }
    }
    public int minDistance(String word1, String word2) {
        //边界
        if (word1.length() < 1||word2.length()<1){
            return  word1.length()<1 ? word2.length() : word1.length();
        }
        //数组
        int[][] dp = new int[word1.length()+1][word2.length()+1];

        //初始化
        for (int i = 0; i <= word1.length(); i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= word2.length(); j++) {
            dp[0][j] = j;
        }
        //遍历
        for (int i = 1; i <= word1.length() ; i++) {
            for (int j = 1; j <= word2.length(); j++) {
                int left = dp[i-1][j] +1;
                int up  = dp[i][j-1] +1;
                int leftUp = word1.charAt(i-1) == word2.charAt(j-1) ? dp[i-1][j-1] : dp[i-1][j-1]+1;
                dp[i][j] = Math.min(left , Math.min(up, leftUp));
            }
        }
        return dp[word1.length()][word2.length()];
    }
}