编辑距离--Levenshtein 【leetcode 72】

def levenshtein(s,t):
    '''
    递推式：默认权重为1
    初始化条件：第0行第0列分别为[0-m,0-n]
    if s[i][j] == t[i][j] :memo[i][j] = memo[i-1][j-1]
    if s[i][j] != t[i][j] :memo[i][j] = min(memo[i-1][j-1]+1,memo[i][j-1]+1,memo[i-1][j-1]+1
    '''
    m,n = len(s),len(t)
    memo = [[0 for i in range(m+1)] for j in range(n+1) ]
    for i in range(m+1):
        for j in range(n+1):
            if i == 0:
                memo[i][j] = j
            if j == 0:
                memo[i][j] = i
            if i > 0 and j > 0:
                if s[i-1] == t[j-1]:
                    memo[i][j] = memo[i-1][j-1]
                else:
                    memo[i][j] = min(memo[i-1][j-1] + 1, memo[i - 1][j] + 1, memo[i][j - 1] + 1)
    print(memo)
    
s = 'abc'
t = 'abe'
levenshtein(s,t)

相似度计算：1-(操作次数/max_len)其中max_len是字符串的最长长度 

编辑距离常用在模糊查询 DNA分析等方面。