OOP stack class template (template +ds)

Catalog

Title Description

AC Code

---

Title Description

With the help of function template, stack operation is realized .

Stack is an advanced and backward data structure , Its insertion 、 Deletion can only be performed at the top of the stack .Push For stack operation , Insert ,Pop For stack out operation , Delete immediately .

Stack operation is similar to stacking plates , The first plate is at the bottom , Put it on the plate after . When you want to pick up the plate , Just take it from the top .

For example, stack data 1 To 2 Until then 3, that 3 At the top ,1 At the bottom . When you want to stack data , Namely 3 First out , Next is 2, And finally 1 Out of the stack .

You are required to define the stack structure by yourself , And use function template and class template to complete char,int and float Data processing . among , We define ：

Input

The first line is the number of test data

For each group of test data , The first row is data type , The second line is the operand

For each operation Push or Pop operation . it is to be noted that , When the stack is empty, you should give Error Tips

Output

For each stack , No output required . For each stack , Output out of stack elements or give Error Tips . When all operations are completed , Output the remaining elements in the stack in reverse order

sample input 1

3
I
6
Push 6
Push 1
Push 1
Pop
Pop
Pop
C
4
Pop
Push a
Push a
Pop
F
8
Push 4.1
Push 4.2
Push 14.1
Push 4.2
Push 1314
Push 1314
Pop
Pop

sample output 1

1 is popped from stack!
1 is popped from stack!
6 is popped from stack!
Empty Stack!
Error!
a is popped from stack!
a 
1314 is popped from stack!
1314 is popped from stack!
4.2 14.1 4.2 4.1 

AC Code

#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
using namespace std;
template<class kind>
class stack {
		kind p[10000];
		int top = -1;
	public:
		void push() {
			kind num;
			cin >> num;
			p[++top] = num;
		}
		void pop() {
			if (empty()) {
				cout << "Error!" << endl;
			} else {
				cout << p[top--] << " is popped from stack!" << endl;
			}
		}
		bool empty() {
			if (top < 0)
				return 1;
			return 0;
		}
		void display() {
			if (empty())
				cout << "Empty Stack!" << endl;
			else {
				for (int i = top;i>=0;i--)
					cout << p[i] << ' ';
				cout << endl;
			}
		}
};
int main() {
	int test, count;
	char code;
	string index;
	cin >> test;
	while (test--) {
		cin >> code >> count;
		if (code == 'I') {
			stack<int> temp;
			while (count--) {
				cin >> index;
				if (index == "Push")
					temp.push();
				else
					temp.pop();
			}
			temp.display();
		} else if (code == 'C') {
			stack<char> temp;
			while (count--) {
				cin >> index;
				if (index == "Push")
					temp.push();
				else
					temp.pop();
			}
			temp.display();
		} else {
			stack<float> temp;
			while (count--) {
				cin >> index;
				if (index == "Push")
					temp.push();
				else
					temp.pop();
			}
			temp.display();
		}
	}
}