leetcode 111: Distinct Subsequences

Distinct Subsequences Oct 19 '12

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) {
        // Start typing your Java solution below
        // DO NOT write main() function
        
        
        
        int slen = S.length();
        int tlen = T.length();
        
        if(slen==0 || tlen==0) return 0;
        
        int[][] d = new int[slen][tlen];
        
        /// d(a,b) = d(a-1,b) + (s[i]==t[j])*d(a-1,b-1);
        if(S.charAt(0) == T.charAt(0)) d[0][0] = 1;
        else d[0][0] = 0;
        
        for(int i=1;i<slen; i++) {
            if( S.charAt(i) == T.charAt(0) ) {
                d[i][0] = d[i-1][0] + 1;
            } else {
                d[i][0] = d[i-1][0];
            }
        }
        
        for(int i=1; i<slen; i++) {
            for(int j=1; j<=i && j<tlen; j++) {
                if( S.charAt(i) == T.charAt(j) ) {
                    d[i][j] = d[i-1][j] + d[i-1][j-1];
                } else {
                    d[i][j] = d[i-1][j];
                }
            }
        }
        
        return d[slen-1][tlen-1];
    }
}