-
Notifications
You must be signed in to change notification settings - Fork 72
Expand file tree
/
Copy pathmain.cpp
More file actions
72 lines (61 loc) · 1.45 KB
/
main.cpp
File metadata and controls
72 lines (61 loc) · 1.45 KB
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
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
class Solution {
public:
string decodeString(string s) {
vector<int> repeat;
vector<stringstream> ss;
repeat.push_back(1);
stringstream start;
ss.push_back(move(start));
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '0' && s[i] <= '9') {
int num_start = i;
while (s[i] >= '0' && s[i] <= '9') {
i++;
}
string num = s.substr(num_start, i - num_start);
repeat.push_back(stoi(num));
stringstream next;
ss.push_back(move(next));
// trust s[i] is '[', go to next
} else if (s[i] >= 'a' && s[i] <= 'z') {
ss.back() << s[i];
} else if (s[i] == ']') {
string curr = ss.back().str();
ss.pop_back();
int repeats = repeat.back();
repeat.pop_back();
for (int r = 0; r < repeats; r++) {
ss.back() << curr;
}
}
}
if (ss.empty()) {
throw;
} else {
return ss[0].str();
}
}
};
int main() {
Solution sol;
string s;
s = "3[a]2[bc]";
cout << sol.decodeString(s) << endl;
s = "3[a2[c]]";
cout << sol.decodeString(s) << endl;
s = "2[abc]3[cd]ef";
cout << sol.decodeString(s) << endl;
s = "abc3[cd]xyz";
cout << sol.decodeString(s) << endl;
return 0;
}