-
Notifications
You must be signed in to change notification settings - Fork 0
/
Decode String - Stacks GFG
89 lines (74 loc) · 1.86 KB
/
Decode String - Stacks GFG
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
/// Stack Data Structure
#include<bits/stdc++.h>
using namespace std;
string decode(string str)
{
stack<int> integerstack;
stack<char> stringstack;
string temp = "", result = "";
for (int i = 0; i < str.length(); i++)
{
int count = 0;
if (str[i] >= '0' && str[i] <='9')
{
while (str[i] >= '0' && str[i] <= '9')
{
count = count * 10 + str[i] - '0';
i++;
}
i--;
integerstack.push(count);
}
else if (str[i] == ']')
{
temp = "";
count = 0;
if (! integerstack.empty())
{
count = integerstack.top();
integerstack.pop();
}
while (! stringstack.empty() && stringstack.top()!='[' )
{
temp = stringstack.top() + temp;
stringstack.pop();
}
if (! stringstack.empty() && stringstack.top() == '[')
stringstack.pop();
for (int j = 0; j < count; j++)
result = result + temp;
for (int j = 0; j < result.length(); j++)
stringstack.push(result[j]);
result = "";
}
else if (str[i] == '[')
{
if (str[i-1] >= '0' && str[i-1] <= '9')
stringstack.push(str[i]);
else
{
stringstack.push(str[i]);
integerstack.push(1);
}
}
else
stringstack.push(str[i]);
}
while (! stringstack.empty())
{
result = stringstack.top() + result;
stringstack.pop();
}
return result;
}
int main()
{
int t;
cin >> t;
while(t--) {
string str;
cin >> str;
cout << decode(str) << endl;
}
return 0;
}