Lintcode 118. Distinct Subsequences (Medium) (Python)

最新推荐文章于 2018-09-30 17:57:18 发布

2Young2Simple

最新推荐文章于 2018-09-30 17:57:18 发布

阅读量125

点赞数

分类专栏： Lintcode刷题文章标签： Lintcode Python

本文链接：https://blog.csdn.net/weixin_41677877/article/details/81530331

版权

Lintcode刷题专栏收录该内容

82 篇文章 0 订阅

订阅专栏

Distinct Subsequences

Description:

Given a string S and a string T, count the number of distinct subsequences of T in S.

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, “ACE” is a subsequence of “ABCDE” while “AEC” is not).
Example

Given S = “rabbbit”, T = “rabbit”, return 3.
Challenge

Do it in O(n2) time and O(n) memory.

O(n2) memory is also acceptable if you do not know how to optimize memory.

Code:

class Solution:
    """
    @param: : A string
    @param: : A string
    @return: Count the number of distinct subsequences
    """

    def numDistinct(self, S, T):
        # write your code here
        dp = [[0 for i in range(len(T)+1)] for i in range(len(S)+1)]
        for i in range(len(S)+1):
            dp[i][0] = 1
        for i in range(1, len(S)+1):
            for j in range(1, min(len(T)+1, i+1)):
                if S[i-1] == T[j-1]:
                    dp[i][j] = dp[i-1][j-1]+dp[i-1][j]
                else:
                    dp[i][j] = dp[i-1][j]
        return dp[len(S)][len(T)]