左神基础班-两个队列模拟栈

最新推荐文章于 2025-11-09 18:48:16 发布

原创最新推荐文章于 2025-11-09 18:48:16 发布 · 243 阅读

1 ·

CC 4.0 BY-SA版权

C++ 同时被 2 个专栏收录

38 篇文章

订阅专栏

左神基础班代码

33 篇文章

订阅专栏

博客围绕左神基础班中两个模拟栈的内容展开，但具体内容未给出。推测可能涉及栈的模拟实现、应用等信息技术相关知识。

#include<queue>
#include<iostream>
using namespace std;
class MyStack{
private:
	queue<char> data;
	queue<char> help;
public:
	int size(){
		return data.size();
	}
	bool push(char c){
		data.push(c);
		return true;
	}
	char top(){
		return data.front();
	}
	void pop(){
		if(data.size()!= 0){
			data.pop();
			while(data.size()>0){
				help.push(data.front());
				data.pop();
			}
			swap();
		}
	}
	//交换两个队列的所有元素，即交换引用的意思
	void swap(){
		queue<char> tmp = data;
		data = help;
		help = tmp;
	}
};
int main(){
	MyStack s;
	s.push('a');
	s.push('b');
	s.push('c');
	cout << "push third time,the size is "<<s.size() << " the top is :" <<s.top() << endl;
	s.pop();
	cout << "pop one time,the size is "<<s.size() << " the top is :" <<s.top() << endl;
	s.pop();
	cout << "pop one time ,the size is "<<s.size() << " the top is :" <<s.top() << endl;
	s.pop();
	cout << "pop one time,the size is "<<s.size() << " the top is :" <<s.top() << endl;
	return 0;
}