Leetcode刷题笔记-两个字符串比较dp

72. Edit Distance f(i, j) := minimum cost (or steps) required to convert first i characters of word1 to first j characters of word2 class Solution(object): def minDistance(self, word1, word2):

>>阅读原文<<