029_编辑距离

知识点：动态规划

LeetCode第七十二题：https://leetcode-cn.com/problems/edit-distance/solution/

我是个无情的抄作业机器

语言GoLang

func minDistance(word1 string, word2 string) int {
    len1 := len(word1)
    len2 := len(word2)

    // init
    dp := make([][]int, len1 + 1)
    for i := 0; i <= len1; i++ {
        dp[i] = make([]int, len2 + 1)
        dp[i][0] = i
    }
    for j := 0; j <= len2; j++ {
        dp[0][j] = j
    }

    for i := 1; i <= len1; i++ {
        for j := 1; j <= len2; j++ {
            if word1[i - 1] == word2[j - 1] {
                dp[i][j] = dp[i - 1][j - 1]
            } else {
                dp[i][j] = min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]) + 1
            }
        }
    }

    return dp[len1][len2]
}


func min(a int, b int, c int) int {
    if a > b {
        if b > c {
            return c
        }
        return b
    }

    if a > c {
        return c
    }
    return a
}