-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStackUsingArr.cpp
More file actions
83 lines (80 loc) · 1.38 KB
/
Copy pathStackUsingArr.cpp
File metadata and controls
83 lines (80 loc) · 1.38 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
#include <iostream>
#include <string>
class stack
{
private:
int size;
int top;
int *stk;
public:
stack(int s) : size(s), top(-1)
{
stk = new int[size];
}
int isEmpty();
int isFull();
void push(int a);
int pop();
void display();
int peek(int index);
};
int stack::isEmpty()
{
return (top == -1);
}
int stack::isFull()
{
return (size - top - 1 == 0);
}
void stack::push(int a)
{
if (isFull())
{
std::cout << "StackOverflow" << std::endl;
}
else
{
top++;
std::cout << "top = " << top << ",Size = " << size << std::endl;
this->stk[top] = a;
}
}
int stack::pop()
{
int x = -1;
if (isEmpty())
{
std::cout << "StackUnderflow" << std::endl;
}
else
{
std::cout << "top = " << top << ",Size = " << size << std::endl;
x = this->stk[top--];
}
return x;
}
void stack::display()
{
while (!isEmpty())
{
std::cout << this->stk[top--] << " ";
}
std::cout << std::endl;
}
int stack::peek(int index)
{
int x = -1;
if (top - index + 1 < 0)
{
std::cout << "Invalid Index" << std::endl;
}
x = stk[top - index + 1];
// TOP - INDEX THEN + 1
return x;
}
int main(int argc, char const *argv[])
{
std::string test = "{[()]}";
std::cout << isBalanced(test) ? "True" : "False";
return 0;
}