115. Distinct Subsequences

最新推荐文章于 2021-08-15 20:07:33 发布

转载最新推荐文章于 2021-08-15 20:07:33 发布 · 55 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ycled/p/3334160.html

本文介绍了一种使用动态规划解决字符串中子序列计数的方法。针对给定的两个字符串S和T，通过两种不同的动态规划方法（2D DP与1D旋转数组）来计算T在S中的不同子序列数量。

摘要生成于 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.

---

DP : 2D

if(T.charAt(i-1) == S.charAt(j-1)) dp[i][j] = dp[i-1][j-1] + dp[i][j-1];  
else dp[i][j] = dp[i][j-1]; 

- dp[i-1][j-1] + dp[i][j-1];　　S(i-1)(j-1)用于T(i-1)(j-1)

- dp[i][j-1]S(i)(j)没有用于自己T(i-1)(j-1)

public class Solution {
    public int numDistinct(String S, String T) {

        int col = S.length() + 1;  
        int row = T.length() + 1;  
        int[][] dp = new int[row][col];  
        
        // init  
        for(int i = 0; i < row; ++i)  
            dp[i][0] = 0;  
        for(int j = 0; j < col; ++j)  
            dp[0][j] = 1;  
          
        for(int i = 1; i < row; ++i)  
            for(int j = 1; j < col; ++j)  
                if(T.charAt(i-1) == S.charAt(j-1)) dp[i][j] = dp[i-1][j-1] + dp[i][j-1];  
                else dp[i][j] = dp[i][j-1];  
                  
        return dp[row-1][col-1];  
    }
}

DP ： 1D rotate array

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