目录

题目

解法一：动态规划

---

题目

解法一：动态规划

int distinctSubseqII(char* s) {const int mod = 1000000007;int dp[26] = {0};int cnt = 1;int len = strlen(s);for (int i = 0; i < len; i++) {int new = (cnt - dp[s[i] - 'a'] + mod) % mod;cnt = (cnt + new) % mod;dp[s[i] - 'a'] = (dp[s[i] - 'a'] + new) % mod;}return (cnt - 1 + mod) % mod;
}