-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
940.java
27 lines (26 loc) · 1.22 KB
/
940.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
public int distinctSubseqII(String S) {
int[] dict = new int[26]; // Save 'total' count when a character appears.
int total = 1; //Empty string, starting at count 1
for (char c : S.toCharArray()) {
int combo = total * 2 - dict[c - 'a']; // New - Duplicates
dict[c - 'a'] = total; // if 'c' ever appears again, it will clash with the current combos.
total = combo < 0 ? combo + 1000000007 : combo % 1000000007; // mod and fix negative mods
}
return total - 1; // Subtract the empty string
}
}
__________________________________________________________________________________________________
sample 35216 kb submission
class Solution {
public int distinctSubseqII(String S) {
long[] end = new long[26];
long mod = (long) Math.pow(10, 9) + 7;
for (char c : S.toCharArray())
end[c - 'a'] = Arrays.stream(end).sum() % mod + 1;
return (int)(Arrays.stream(end).sum() % mod);
}
}
__________________________________________________________________________________________________