-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstackk.cpp
83 lines (80 loc) · 1.07 KB
/
stackk.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
#include<bits/stdc++.h>
using namespace std;
class MinStack
{
private:
struct minData
{
int min;
int cnt;
minData() :min(0), cnt(0) {}
minData(int m, int c) :min(m), cnt(c) {}
};
stack<int> realstack;
stack<minData> minStack;
int min;
public:
void push(int x)
{
if (realstack.empty()==true)
{
min = x;
minStack.push(minData(x, 1));
}
else
{
if (min>=x)
{
min = x;
if (minStack.top().min==x)
{
++minStack.top().cnt;
}
else
{
minStack.push(minData(x, 1));
}
}
}
realstack.push(x);
}
void pop()
{
if (realstack.empty()==true)
{
return;
}
int x = realstack.top();
realstack.pop();
if (x=minStack.top().min)
{
if (minStack.top().cnt > 1)
{
minStack.top().cnt--;
}
else
{
minStack.pop();
min = minStack.top().min;
}
}
}
int top() {
return realstack.top();
}
int getMin() {
return min;
}
void clear() {
while (realstack.empty()==false)
{
realstack.pop();
}
while (minStack.empty() == false);
minStack.pop();
}
};
int main()
{
return 0;
}