-
Notifications
You must be signed in to change notification settings - Fork 0
/
Reversing.cpp
88 lines (71 loc) · 1.29 KB
/
Reversing.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
#include <iostream>
#include<string>
using namespace std;
class Stack
{
private:
int stackCap;
int stackSize;
char *vec;
public:
Stack(int s)
{
vec = new char[s];
stackSize = 0;
stackCap = s;
}
~Stack()
{
delete[] vec;
}
bool isEmpty()
{
return stackSize == 0;
}
bool isFull()
{
return stackSize == stackCap;
}
void push(char e)
{
if(isFull())
return;
vec[stackSize++] = e;
}
char pop()
{
if(isEmpty())
return -1;
return vec[--stackSize];
}
void Reverse(string str)
{
int cpa = str.length();
Stack s(cpa);
for (int i = 0 ; i < cpa ; i++)
{
s.push(str[i]) ;
}
for (int i = 0; i < cpa ; i++)
{
str[i] = s.pop();
}
cout << str << endl;
}
};
int main()
{
int n;
cin >> n;
Stack mystack(n+1);
string str[n+1];
for(int i = 0 ; i < n+1 ; i++)
{
getline(cin,str[i]);
}
for(int i = 0 ; i < n+1 ; i++)
{
mystack.Reverse(str[i]);
}
return 0;
}