forked from hongtaocai/code_interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinStack.cpp
More file actions
71 lines (59 loc) · 1.15 KB
/
MinStack.cpp
File metadata and controls
71 lines (59 loc) · 1.15 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
#include <stack>
#include <iostream>
using namespace std;
vector<int> st;
class IndexToValStack {
public:
vector<int> indexSt;
vector<int> valSt;
IndexToValStack() {
}
void push(int x, int index) {
if(index==0) {
indexSt.push_back(index);
valSt.push_back(x);
} else {
if(x!=valSt.back()) {
indexSt.push_back(index);
valSt.push_back(x);
}
}
}
void pop(int index) {
if(index == indexSt.back()) {
indexSt.pop();
valSt.pop();
}
}
int top() {
return valSt.back();
}
};
IndexToValStack mins;
class MinStack {
public:
int min(int a, int b){
if(a<b) {
return a;
}
return b;
}
void push(int x) {
if(st.size()>0) {
mins.push(min(mins.back(), x), st.size());
} else {
mins.push(x, 0);
}
st.push_back(x);
}
void pop() {
st.push_back();
mins.pop(st.size());
}
int top() {
return st.back();
}
int getMin() {
return mins.top();
}
};