feat: add solutions to lc problem: No.0940

No.0940.Distinct Subsequences II

Author: YangFong

solution/0900-0999/0940.Distinct Subsequences II/README.md

@@ -237,6 +237,64 @@ func distinctSubseqII(s string) int {
 }
 ```
 
+### **C**
+
+```c
+int distinctSubseqII(char * s){
+    int mod = 1e9 + 7;
+    int n = strlen(s);
+    int dp[26] = {0};
+    for (int i = 0 ; i < n; i++) {
+        int sum = 0;
+        for (int j = 0; j < 26; j++) {
+            sum = (sum + dp[j]) % mod; 
+        }
+        dp[s[i] - 'a'] = sum + 1;
+    }
+    int res = 0;
+    for (int i = 0 ; i < 26; i++) {
+        res = (res + dp[i]) % mod;
+    }
+    return res;
+}
+```
+
+### **TypeScript**
+
+```ts
+function distinctSubseqII(s: string): number {
+    const mod = 1e9 + 7;
+    const dp = new Array(26).fill(0);
+    for (const c of s) {
+        dp[c.charCodeAt(0) - 'a'.charCodeAt(0)] =
+            dp.reduce((r, v) => (r + v) % mod, 0) + 1;
+    }
+    return dp.reduce((r, v) => (r + v) % mod, 0);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn distinct_subseq_ii(s: String) -> i32 {
+        const MOD: i32 = 1e9 as i32 + 7;
+        let mut dp = [0; 26];
+        for u in s.as_bytes() {
+            let i = (u - &b'a') as usize;
+            dp[i] = {
+                let mut sum = 0;
+                dp.iter().for_each(|&v| sum = (sum + v) % MOD);
+                sum
+            } + 1;
+        }
+        let mut res = 0;
+        dp.iter().for_each(|&v| res = (res + v) % MOD);
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0940.Distinct Subsequences II/README_EN.md

@@ -203,6 +203,64 @@ func distinctSubseqII(s string) int {
 }
 ```
 
+### **C**
+
+```c
+int distinctSubseqII(char * s){
+    int mod = 1e9 + 7;
+    int n = strlen(s);
+    int dp[26] = {0};
+    for (int i = 0 ; i < n; i++) {
+        int sum = 0;
+        for (int j = 0; j < 26; j++) {
+            sum = (sum + dp[j]) % mod; 
+        }
+        dp[s[i] - 'a'] = sum + 1;
+    }
+    int res = 0;
+    for (int i = 0 ; i < 26; i++) {
+        res = (res + dp[i]) % mod;
+    }
+    return res;
+}
+```
+
+### **TypeScript**
+
+```ts
+function distinctSubseqII(s: string): number {
+    const mod = 1e9 + 7;
+    const dp = new Array(26).fill(0);
+    for (const c of s) {
+        dp[c.charCodeAt(0) - 'a'.charCodeAt(0)] =
+            dp.reduce((r, v) => (r + v) % mod, 0) + 1;
+    }
+    return dp.reduce((r, v) => (r + v) % mod, 0);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn distinct_subseq_ii(s: String) -> i32 {
+        const MOD: i32 = 1e9 as i32 + 7;
+        let mut dp = [0; 26];
+        for u in s.as_bytes() {
+            let i = (u - &b'a') as usize;
+            dp[i] = {
+                let mut sum = 0;
+                dp.iter().for_each(|&v| sum = (sum + v) % MOD);
+                sum
+            } + 1;
+        }
+        let mut res = 0;
+        dp.iter().for_each(|&v| res = (res + v) % MOD);
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0940.Distinct Subsequences II/Solution.c

@@ -0,0 +1,17 @@
+int distinctSubseqII(char * s){
+    int mod = 1e9 + 7;
+    int n = strlen(s);
+    int dp[26] = {0};
+    for (int i = 0 ; i < n; i++) {
+        int sum = 0;
+        for (int j = 0; j < 26; j++) {
+            sum = (sum + dp[j]) % mod; 
+        }
+        dp[s[i] - 'a'] = sum + 1;
+    }
+    int res = 0;
+    for (int i = 0 ; i < 26; i++) {
+        res = (res + dp[i]) % mod;
+    }
+    return res;
+}

solution/0900-0999/0940.Distinct Subsequences II/Solution.rs

@@ -0,0 +1,17 @@
+impl Solution {
+    pub fn distinct_subseq_ii(s: String) -> i32 {
+        const MOD: i32 = 1e9 as i32 + 7;
+        let mut dp = [0; 26];
+        for u in s.as_bytes() {
+            let i = (u - &b'a') as usize;
+            dp[i] = {
+                let mut sum = 0;
+                dp.iter().for_each(|&v| sum = (sum + v) % MOD);
+                sum
+            } + 1;
+        }
+        let mut res = 0;
+        dp.iter().for_each(|&v| res = (res + v) % MOD);
+        res
+    }
+}

solution/0900-0999/0940.Distinct Subsequences II/Solution.ts

@@ -0,0 +1,9 @@
+function distinctSubseqII(s: string): number {
+    const mod = 1e9 + 7;
+    const dp = new Array(26).fill(0);
+    for (const c of s) {
+        dp[c.charCodeAt(0) - 'a'.charCodeAt(0)] =
+            dp.reduce((r, v) => (r + v) % mod, 0) + 1;
+    }
+    return dp.reduce((r, v) => (r + v) % mod, 0);
+}