Distinct Subsequences

最新推荐文章于 2024-09-21 16:35:48 发布

dutsoft

最新推荐文章于 2024-09-21 16:35:48 发布

阅读量460

点赞数

文章标签：算法 dp

本文链接：https://blog.csdn.net/dutsoft/article/details/38664663

版权

LeetCode 专栏收录该内容

111 篇文章 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).

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

Return 3.

public class Solution {
    public int numDistinct(String S, String T) {
        int m=S.length();
        int n=T.length();
        if(n>m || m==0) return 0;
        int []f=new int[n+1];
        f[0]=1;
        for(int i=0;i<m;i++){
            for(int j=n-1;j>=0;j--){
                if(S.charAt(i)==T.charAt(j)){
                    f[j+1]+=f[j];
                }
                else continue;
            }
        }
        return f[n];
    }
}