Distinct Subsequences II

Given a string s, return the number of distinct non-empty subsequences of s. Since the answer may be very large, return it modulo 109 + 7.

A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not.

Example 1:

Input: s = "abc"
Output: 7
Explanation: The 7 distinct subsequences are "a", "b", "c", "ab", "ac", "bc", and "abc".

Example 2:

Input: s = "aba"
Output: 6
Explanation: The 6 distinct subsequences are "a", "b", "ab", "aa", "ba", and "aba".

Example 3:

Input: s = "aaa"
Output: 3
Explanation: The 3 distinct subsequences are "a", "aa" and "aaa".

Constraints:

• 1 <= s.length <= 2000
• s consists of lowercase English letters.

思路：dp[i] 表示到目前为止能够找到的所有的subsequence，递推公式就是:

for all 0, j < i, dp[i] += dp[j] if s[i] != s[j];

if s[i] == s[j] skip, 避免重复；

最后结果就是sum (dp[0]...dp[n]);

class Solution {
    public int distinctSubseqII(String s) {
        int n = s.length();
        int[] dp = new int[n];
        Arrays.fill(dp, 1);
        int res = 0;
        int MOD = 1000000007;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < i; j++) {
                if(s.charAt(j) != s.charAt(i)) {
                    dp[i] += dp[j];
                    dp[i] %= MOD;
                }
            }
            res += dp[i];
            res %= MOD;
        }
        return res;
    }
}