LeetCode--72--hard--EditDistance

summary:

dynamic program

package myapp.kit.leetcode.top100liked;

import java.util.HashMap;
import java.util.Map;

/**
 *
 * 72
 * hard
 * https://leetcode.com/problems/edit-distance/
 *
 * Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
 *
 * You have the following 3 operations permitted on a word:
 *
 * Insert a character
 * Delete a character
 * Replace a character
 * Example 1:
 *
 * Input: word1 = "horse", word2 = "ros"
 * Output: 3
 * Explanation:
 * horse -> rorse (replace 'h' with 'r')
 * rorse -> rose (remove 'r')
 * rose -> ros (remove 'e')
 *
 * Example 2:
 * Input: word1 = "intention", word2 = "execution"
 * Output: 5
 * Explanation:
 * intention -> inention (remove 't')
 * inention -> enention (replace 'i' with 'e')
 * enention -> exention (replace 'n' with 'x')
 * exention -> exection (replace 'n' with 'c')
 * exection -> execution (insert 'u')
 *
 *
 *
 * @author huangdingsheng
 * @version 1.0, 2020/5/14
 */
public class EditDistance {

    Map<String, Integer> cache = new HashMap<>();

    public int minDistance(String word1, String word2) {
        int res = 0;
        // pruning
        if (cache.containsKey(word1 + word2)) {
            return cache.get(word1 + word2);
        }
        // 递归出口
        if (word1.length() == 0 && word2.length() == 0) {
            res = 0;
        } else if (word1.length() == 0 && word2.length() > 0) {
            res = word2.length();
        } else if (word1.length() > 0 && word2.length() == 0) {
            res = word1.length();
        } else if (word1.charAt(word1.length() - 1) == word2.charAt(word2.length() - 1)) {
            res = minDistance(word1.substring(0, word1.length() - 1), word2.substring(0, word2.length() - 1));
        } else {
            // 状态转移
            res = Math.min(Math.min(1 + minDistance(word1.substring(0, word1.length() - 1), word2),
                    1 + minDistance(word1.substring(0, word1.length() - 1), word2.substring(0, word2.length() - 1))),
                    1 + minDistance(word1, word2.substring(0, word2.length() - 1)));
        }

        // cache result
        cache.put(word1 + word2, res);
        return res;

    }

}