forked from xperzy/careerup150
-
Notifications
You must be signed in to change notification settings - Fork 0
/
3-3.cpp
99 lines (76 loc) · 1.75 KB
/
3-3.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
89
90
91
92
93
94
95
96
97
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
class SetOfStack{
vector<stack<int> > stacks;
int capacity;
public:
SetOfStack(int cap):capacity(cap){}
void push(int i){
if (getLastStack()>=0 && stacks[getLastStack()].size()<capacity){
stacks[getLastStack()].push(i);
cout << i << "pushed into " << getLastStack() << endl;
}else {
stack<int> nst;
nst.push(i);
stacks.push_back(nst);
cout << i << "pushed into new stack " << getLastStack() << endl;
}
}
void pop(){
if (stacks[getLastStack()].size()==0){cerr<< "Empty stack!" << endl; }
else{
if (stacks[getLastStack()].size()==1){
stacks.pop_back();
}else{
stacks[getLastStack()].pop();
}
}
}
void popAt(int index){
if (index>getLastStack() || index<0){cerr<<"Index out of range!" << endl;}
else{
if (stacks[index].size()==1){
stacks.erase(stacks.begin()+index);
}else{
stacks[index].pop();
}
}
}
int top() {
if ( !isempty() && (!stacks[getLastStack()].empty())){
return stacks[getLastStack()].top();
}else{cerr<< "Empty Stack"<<endl;}
}
int topAt(int index){
if (index>getLastStack() || index<0){cerr<<"Index out of range!" << endl;}
else{
return stacks[index].top();
}
}
bool isempty(){
if (stacks.size()==0){return true;}
else{
return false;
}
}
int size(){
return stacks.size();
}
int getLastStack(){
return stacks.size()-1;
}
};
int main(){
SetOfStack sst(4);
for (int i=1;i<16;i++){
sst.push(i);
}
for (int i=0;i<sst.size();i++){
sst.popAt(i);
cout << "poping " << i << "th stack...";
cout << "Top element now is: " << sst.topAt(i)<<endl;
}
return 0;
}