-
Notifications
You must be signed in to change notification settings - Fork 8
/
leetcode2645-minimum-additions-to-make-valid-string.cpp
89 lines (74 loc) · 1.87 KB
/
leetcode2645-minimum-additions-to-make-valid-string.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
/*
* leetcode2645-minimum-additions-to-make-valid-string.cpp
*
* @author Wang Guibao ([email protected])
* @date 2023/10/09 14:45
* @brief https://leetcode.com/problems/minimum-additions-to-make-valid-string/
*/
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
int addMinimum(string word) {
int len = word.length();
int n = 0;
int i = 0;
int curLen = 0;
while (i < len) {
char c = word[i];
switch (c) {
case 'a':
if (curLen == 0) {
++curLen;
} else if (curLen == 1) {
n += 2;
} else if (curLen == 2) {
n += 1;
curLen = 1;
}
break;
case 'b':
if (curLen == 0) {
n += 1;
curLen = 2;
} else if (curLen == 1) {
++curLen;
} else if (curLen == 2) {
n += 2;
}
break;
case 'c':
if (curLen == 0) {
n += 2;
} else if (curLen == 1) {
n += 1;
curLen = 0;
} else if (curLen == 2) {
curLen = 0;
}
break;
default:
break;
}
++i;
}
if (curLen > 0) {
n += (3 - curLen);
}
return n;
}
};
int main() {
while (1) {
std::string word;
std::cout << "Input word: ";
if (!std::getline(std::cin, word)) {
return 0;
}
Solution solution;
auto ret = solution.addMinimum(word);
std::cout << ret << std::endl;
}
return 0;
}