原理:找到两个字符串的最长公共子序列
注:子串要求在原字符串中是连续的,而子序列则只需保持相对顺序一致,并不要求连续;s1=abcd,s2=abssc
此处:最长公共子串:ab;最长公共子序列:abc
示例 1:
输入: word1 = "horse", word2 = "ros"
输出: 3
解释:
horse -> rorse (将 'h' 替换为 'r')
rorse -> rose (删除 'r')
rose -> ros (删除 'e')
示例 2:
输入: word1 = "intention", word2 = "execution"
输出: 5
解释:
intention -> inention (删除 't')
inention -> enention (将 'i' 替换为 'e')
enention -> exention (将 'n' 替换为 'x')
exention -> exection (将 'n' 替换为 'c')
exection -> execution (插入 'u'
class Solution:
def minDistance(self, word1, word2):
n1 = len(word1)
n2 = len(word2)
dp = [[0] * (n2 + 1) for _ in range(n1 + 1)]
# 第一行