class Solution:
def minDistance(self, word1: str, word2: str) -> int:
@cache
def dfs(i,j):
if i<0:return j+1
if j<0:return i+1
if word1[i]==word2[j]:
return dfs(i-1,j-1)
return min(dfs(i-1,j),dfs(i,j-1),dfs(i-1,j-1))+1
return dfs(len(word1)-1,len(word2)-1)
return j+1,因为有j+1个values to be removed
return min()+1, +1是因为我们执行了move或者swap操作