LeetCode-Distinct Subsequences

本文介绍了一种解决特定字符串匹配问题的算法:计算一个字符串作为另一个字符串子序列出现的不同方式的数量。通过动态规划方法实现了高效的解决方案,并给出了具体的C++实现代码。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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).

Here is an example:
S = "rabbbit"T = "rabbit"

Return 3.

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    int numDistinct(string S, string T) {
        const int lengthS = S.size(), lengthT = T.size();
        int **dp = new int *[lengthS+1];
        for (int i = 0; i < lengthS+1; ++i) {
            dp[i] = new int[lengthT+1];
            memset(dp[i], 0, sizeof(int)*(lengthT+1));
        }
        for (int i = 0; i < lengthS+1; ++i)
            dp[i][0] = 1;
        for (int i = 1; i < lengthS+1; ++i)
            for (int j = 1; j < lengthT+1; ++j)
                dp[i][j] = dp[i-1][j]+(S[i-1]==T[j-1]?dp[i-1][j-1]:0);
        int result = dp[lengthS][lengthT];
        for (int i = 0; i < lengthS+1; ++i)
            delete [] dp[i];
        delete [] dp;
        return result;
    }
};</span>



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值