Question

How to implement stack using vector and queue in C++

Answer 1

#include <iostream>
#include <queue>

using namespace std;

class Stack
{
	queue<int> q;

public:
	void push(int number) {
		q.push(number);
	}

	int pop() {
	    if (q.empty()) {
			cout << "empty";
			exit(0);
		}

		int front = q.front();
		q.pop();

		return front;
	}
};

int main()
{
	vector<int> vec = {9, 4, 0, 1, 7};

	Stack s;
	
	for (int number : vec) {
		s.push(number);
	}

	for (int i = 0; i <= vec.size(); i++)
		cout << s.pop() << endl;

	return 0;
}



/*
run:

9
4
0
1
7
empty

*/

 

70+ SQL courses for beginners and professionals