lintcode:Distinct Subsequences

504 篇文章 0 订阅
66 篇文章 0 订阅

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

S = "rabbbit"T = "rabbit"

Return 3.


class Solution {
public:    
    /**
     * @param S, T: Two string.
     * @return: Count the number of distinct subsequences
     */
    int numDistinct(string &S, string &T) {
        // write your code here
        int stringSize = S.size();
        int templateSize = T.size();
        
        if (stringSize == 0 || templateSize == 0 || templateSize > stringSize)
            return 0;
            
        vector<vector<int>> dp(templateSize+1, vector<int>(stringSize+1));
        
        dp[0][0] = 1;
        
        for (int j=1; j<=stringSize; j++)
        {
            dp[0][j] = 1; //空串也是S的自序列
        }
        
        for (int i=1; i<=templateSize; i++)
        {
            dp[i][0] = 0;
        }
        
        for (int i=1; i<=templateSize; i++)
        {
            for (int j=1; j<=stringSize; j++)
            {
                if (S[j-1] == T[i-1])
                {
                    dp[i][j] = dp[i][j-1] + dp[i-1][j-1];
                }
                else
                {
                    dp[i][j] = dp[i][j-1];
                }
            }
        }
        
        return dp[templateSize][stringSize];
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值