-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
99 lines (77 loc) · 1.74 KB
/
main.cpp
File metadata and controls
99 lines (77 loc) · 1.74 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
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
#include <iostream>
using namespace std;
#define MAX 1000000
class Stack {
int top;
char a[MAX];
public:
Stack() {
top = -1;
}
bool push(int x) {
if (top >= (MAX - 1)) {
return false;
} else {
a[++top] = x;
return true;
}
}
int pop() {
if (top < 0) {
return 0;
} else {
int x = a[top--];
return x;
}
}
int peek() {
if (top < 0) {
return 0;
} else {
int x = a[top];
return x;
}
}
bool isEmpty() {
return (top < 0);
}
void display() {
if (isEmpty())
cout << "-1";
else
for (int i = top; i >= 0; i--)
cout << a[i];
}
};
void editText(string inputString) {
Stack stack1, helpingStack;
int size = 0;
while (inputString[size])
size++;
for (int i = 0; i < size; i++) {
if (inputString[i] != '<' && inputString[i] != '>' && inputString[i] != '-')
stack1.push(inputString[i]);
else if (inputString[i] == '<') {
if (!stack1.isEmpty())
helpingStack.push(stack1.pop());
}
else if (inputString[i] == '>') {
if (!helpingStack.isEmpty())
stack1.push(helpingStack.pop());
}
else if (inputString[i] == '-') {
if (!stack1.isEmpty())
stack1.pop();
}
}
while (!helpingStack.isEmpty())
stack1.push(helpingStack.pop());
while (!stack1.isEmpty())
helpingStack.push(stack1.pop());
helpingStack.display();
}
int main() {
string s;
cin >> s;
editText(s);
}