代码随想录算法训练营第48天 |各种字符串

1、不同子序列

class Solution:
    def numDistinct(self, s: str, t: str) -> int:
        # 初始化：dp[i][0]和dp[0][j]
        # dp[i][0]实际上是求s有几种删除方法可以变成空字符串：1种
        # dp[0][j]本身s是空字符串，有几种方法删除到t（不为空）：0种
        # dp[0][0]空字符串中有几个空字符串？1个
        dp = [[1]*(len(t)+1) for i in range(len(s)+1)]
        for j in range(1, len(dp[0])):
            dp[0][j] = 0
        for i in range(1, len(s)+1):
            for j in range(1, len(t)+1):
                if s[i-1] == t[j-1]:
                    # 使用s[i-1]和不使用的情况相加(考虑删除s[i-1])
                    dp[i][j] = dp[i-1][j-1] + dp[i-1][j]
                    
                else:
                    # 两个元素不一样的话，直接删除s[i-1]
                    dp[i][j] = dp[i-1][j]
        return dp[-1][-1]

2、两字符串删除操作

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        # dp含义：长度为i的word1和长度为j的word2变到相同需要dp[i][j]步
        dp = [[0]*(len(word2)+1) for _ in range(len(word1)+1)]
        # 初始化：有一字符串为空，需要将另一字符串删除至空，需要多少操作
        for i in range(len(dp[0])):
            dp[0][i] = i
        for i in range(len(dp)):
            dp[i][0] = i
        for i in range(1, len(word1)+1):
            for j in range(1, len(word2)+1):
                # 字符相同，不用操作，直接继承
                if word1[i-1] == word2[j-1]:
                    dp[i][j] = dp[i-1][j-1]
                # 字符不相同需要从word1 或word2中进行一次删除操作
                else:
                    dp[i][j] = min(dp[i-1][j]+1, dp[i][j-1]+1)
        return dp[-1][-1]

3、编辑距离

class Solution:
    def minDistance(self, word1: str, word2: str) -> int:
        dp = [[0]*(len(word2)+1) for _ in range(len(word1)+1)]
        for i in range(len(dp[0])):
            dp[0][i] = i
        for i in range(len(dp)):
            dp[i][0] = i
        for i in range(1, len(word1)+1):
            for j in range(1, len(word2)+1):
                if word1[i-1] == word2[j-1]:
                    dp[i][j] = dp[i-1][j-1]
                else:
                    # 思路：和上题一样，添加操作本质上就是对word2删除
                    # 替换操作实际上是从上一个状态+1操作就可以
                    #               删除操作       添加操作      替换操作
                    dp[i][j] = min(dp[i-1][j]+1, dp[i][j-1]+1, dp[i-1][j-1]+1) 
        return dp[-1][-1]