leetcode——编辑距离

两个字符串如何进行删除，替换和插入，最少执行次数

class Solution:
    def oneEditAway(self, first: str, second: str) -> bool:
        l1=len(first)
        l2=len(second)
        dp=[[0]*(l1+1)for _ in range(l2+1)]
        for i in range(1,l2+1):
            dp[i][0]=i
        for j in range(1,l1+1):
            dp[0][j]=j
        for i in range(1,l2+1):
            for j in range(1,l1+1):
                if second[i-1]==first[j-1]:
                    dp[i][j]=dp[i-1][j-1]
                else:
                    dp[i][j]=min(dp[i][j-1],dp[i-1][j],dp[i-1][j-1])+1
        return True if dp[-1][-1]<=1 else False