阿里0831算法笔试 第一题 未尝试

editdis = int(input())
mindis = int(input())
maxdis = int(input())
a = [i for i in input().split(',')]
b = [i for i in input().split(',')]
def edit_distance(word1, word2):
    len1 = len(word1)
    len2 = len(word2)
    dp = [[0 for i in range(len2+1)] for j in range(len1+1)]
    for i in range(len1 + 1):
        dp[i][0] = i
    for j in range(len2 + 1):
        dp[0][j] = j
    for i in range(1, len1 + 1):
        for j in range(1, len2 + 1):
            delta = 0 if word1[i - 1] == word2[j - 1] else 1
            dp[i][j] = min(dp[i - 1][j - 1] + delta, min(dp[i - 1][j] + 1, dp[i][j - 1] + 1))
    return dp[len1][len2]
def getsubListWithLen(num_list, mindis, maxdis):
    def getSubList(num_list):
        if len(num_list) == 1:
            return [num_list]
        sub_list = getSubList(num_list[:-1])
        extra =