-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay14.cpp
105 lines (91 loc) · 2.17 KB
/
Day14.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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
<<<<<<< HEAD
#include <iostream>
using namespace std;
int stringLength(char s[]) {
int length = 0;
while (s[length] != '\0') {
length++;
}
return length;
}
int countSubstringsWithKDistinct(char s[], int k) {
int n = stringLength(s);
int count = 0;
for (int i = 0; i < n; ++i) {
int charFrequency[26] = {0};
int distinctCount = 0;
for (int j = i; j < n; ++j) {
int index = s[j] - 'a';
if (charFrequency[index] == 0) {
distinctCount++;
}
charFrequency[index]++;
if (distinctCount == k) {
count++;
}
if (distinctCount > k) {
break;
}
}
}
return count;
}
int main() {
char s[10000];
int k;
// Input string and integer k
cout << "Enter the string: ";
cin >> s;
cout << "Enter the value of k: ";
cin >> k;
// Output the result
int result = countSubstringsWithKDistinct(s, k);
cout << "Output: " << result << endl;
return 0;
}
=======
#include <iostream>
using namespace std;
int stringLength(char s[]) {
int length = 0;
while (s[length] != '\0') {
length++;
}
return length;
}
int countSubstringsWithKDistinct(char s[], int k) {
int n = stringLength(s);
int count = 0;
for (int i = 0; i < n; ++i) {
int charFrequency[26] = {0};
int distinctCount = 0;
for (int j = i; j < n; ++j) {
int index = s[j] - 'a';
if (charFrequency[index] == 0) {
distinctCount++;
}
charFrequency[index]++;
if (distinctCount == k) {
count++;
}
if (distinctCount > k) {
break;
}
}
}
return count;
}
int main() {
char s[10000];
int k;
// Input string and integer k
cout << "Enter the string: ";
cin >> s;
cout << "Enter the value of k: ";
cin >> k;
// Output the result
int result = countSubstringsWithKDistinct(s, k);
cout << "Output: " << result << endl;
return 0;
}
>>>>>>> 733607e6d66e75f6545553e48563c1f9fe57d3a9