[Leetcode] Distinct Subsequences

最新推荐文章于 2016-09-30 12:30:23 发布

w444377010

最新推荐文章于 2016-09-30 12:30:23 发布

阅读量119

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/w444377010/article/details/52594935

版权

leetcode 专栏收录该内容

43 篇文章 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[][] record = new int[s.length() + 1][t.length() + 1];
        for(int i = 0; i < s.length() + 1; i++) {
            record[i][0] = 1;
        }
        
        for(int i = 1; i < s.length() + 1; i++) {
            for(int j = 1; j < t.length() + 1; j ++) {
                record[i][j] = record[i-1][j];
                if(s.charAt(i - 1) == t.charAt(j - 1)) {
                    record[i][j] += record[i-1][j-1];
                }
            }
        }
        return record[s.length()][t.length()];
    }
}