题解 | #最长上升子序列(一)#

#coding:utf-8
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param str1 string字符串 
# @param str2 string字符串 
# @return int整型
#
class Solution:
    def editDistance(self , str1 , str2 ):
        # write code here
        if not str1 and not str2:
            return 0
        if not str1:
            return len(str2)
        if not str2:
            return len(str1)
        m,n = len(str1),len(str2)
        mark = [[0]*(n+1) for i in range(m+1)]
        for i in range(m+1):
            for j in range(n+1):
                if i==0 :
                    mark[i][j] = j
                    continue
                if j==0 :
                    mark[i][j] = i 
                    continue
                if str1[i-1]==str2[j-1]:
                    mark[i][j] = mark[i-1][j-1]
                    continue
                mark[i][j] = min(mark[i-1][j-1],mark[i-1][j],mark[i][j-1]) + 1
                
        for i in mark:
            print(i)
        return mark[m][n]