-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1100.cpp
57 lines (50 loc) · 1.48 KB
/
1100.cpp
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
__________________________________________________________________________________________________
int F[10010][26];
class Solution {
public:
int numKLenSubstrNoRepeats(string s, int k) {
int n = s.size();
for (int i = 0; i < n; ++ i)
{
for (int j = 0; j < 26; ++ j)
F[i+1][j] = F[i][j] + (s[i] == j+'a');
}
int ret = 0;
for (int i = k; i <= n; ++ i)
{
int flag = 0;
for (int j = 0; j < 26; ++ j)
if (F[i][j]-F[i-k][j] >= 2) flag = 1;
if (!flag) ret ++;
}
return ret;
}
};
__________________________________________________________________________________________________
class Solution {
public:
int numKLenSubstrNoRepeats(string S, int K) {
int n=S.length();
int cnt[30], fail=0;
memset(cnt, 0, sizeof(cnt));
if (n<K) return 0;
int ans=0;
for (int i=0; i<K; i++){
int c=S[i]-'a';
++cnt[c];
if (cnt[c]==2) ++fail;
}
if (fail==0) ++ans;
for (int i=K; i<n; i++){
int c=S[i]-'a';
++cnt[c];
if (cnt[c]==2) ++fail;
c=S[i-K]-'a';
--cnt[c];
if (cnt[c]==1) --fail;
if (fail==0) ++ans;
}
return ans;
}
};
__________________________________________________________________________________________________