-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
49 lines (44 loc) · 1.24 KB
/
main.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
class Solution {
public:
string removeDuplicates(string s, int k) {
struct CharCount {
char c;
int count;
};
vector<CharCount> char_count;
for (int i = 0; i < s.size(); ++i) {
char c = s[i];
if (char_count.empty() || char_count.back().c != c) {
char_count.push_back({c, 1});
} else {
++char_count.back().count;
}
if (!char_count.empty() && char_count.back().count == k)
char_count.pop_back();
}
string result;
for (auto cc : char_count) {
while (cc.count--) result += cc.c;
}
return result;
}
};
class Solution {
public:
string removeDuplicates(string s, int k) {
vector<tuple<char, int>> dups;
for (char c : s) {
if (dups.empty() || get<char>(dups.back()) != c) {
dups.push_back({c, 1});
} else {
++get<int>(dups.back());
}
if (!dups.empty() && get<int>(dups.back()) == k) dups.pop_back();
}
string result;
for (auto [c, i] : dups) {
while (i--) result += c;
}
return result;
}
};