-
Notifications
You must be signed in to change notification settings - Fork 0
/
MaxStack.h
151 lines (141 loc) · 2.17 KB
/
MaxStack.h
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
#ifndef _MAX_STACK_
#define _MAX_STACK_
#include "Stack.h"
#ifndef NULL
#define NULL 0
#endif
template <typename T>
class MaxStack
{
private:
Stack <T> max_stack;
Stack <T> _data;
public:
bool empty(){
return _data.empty();
}
T max(){
return max_stack.top();
}
void push(T ele){
_data.push(ele);
if(max_stack.empty() || ele >= max_stack.top()){
max_stack.push(ele);
}
}
T pop(){
T tmp = _data.top();
if(_data.pop() == max_stack.top()){
max_stack.pop();
}
return tmp;
}
T top(){
return _data.top();
}
};
template <typename T>
class MaxQueue{
private:
MaxStack <T> s1,s2;
public:
bool empty(){
return s1.empty() && s2.empty();
}
void enqueue(T ele){
s1.push(ele);
}
T dequeue(){
if(s2.empty()){
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
return s2.pop();
}
T front(){
if(s2.empty()){
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
return s2.top();
}
T max(){
if((!s1.empty()) && (!s2.empty()))
return (s1.max() > s2.max() ? s1.max() : s2.max());
else if ((!s1.empty()) && (s2.empty()))
return s1.max();
else return s2.max();
}
};
template <typename T>
class MinStack
{
private:
Stack <T> min_stack;
Stack <T> _data;
public:
bool empty(){
return _data.empty();
}
T min(){
return min_stack.top();
}
void push(T ele){
_data.push(ele);
if(min_stack.empty() || ele <= min_stack.top()){
min_stack.push(ele);
}
}
T pop(){
T tmp = _data.top();
if(_data.pop() == min_stack.top()){
min_stack.pop();
}
return tmp;
}
T top(){
return _data.top();
}
};
template <typename T>
class MinQueue{
private:
MinStack <T> s1,s2;
public:
bool empty(){
return s1.empty() && s2.empty();
}
void enqueue(T ele){
s1.push(ele);
}
T dequeue(){
if(s2.empty()){
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
return s2.pop();
}
T front(){
if(s2.empty()){
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
return s2.top();
}
T max(){
if((!s1.empty()) && (!s2.empty()))
return (s1.min() > s2.min() ? s1.min() : s2.min());
else if ((!s1.empty()) && (s2.empty()))
return s1.min();
else return s2.min();
}
};
#endif