#include <iostream>
#include <stack>
#include <vector>
#include <list>
using namespace std;
int main()
{
stack<int, deque<int>> a; //a是deque类的堆栈,
stack<int, vector<int>> b;
stack<int, list<int>> c;
stack<int> d; // d是默认的deque类的堆栈,堆栈是后进先出,
d.push(2);
d.push(10);
d.push(20);
cout << "现在栈里有:" << d.size() << "个数据。" << endl;
while (d.empty()==false)
//while (d.size() != 0)
{
int x = d.top(); //查看,不删除,d.pop是删除,
d.pop();//删除,
cout << x << endl; // 输出的是20,
}
cout << "现在栈里有:" << d.size() << "个数据。" << endl; //是0个数据,
//x = d.top(); //查看,不删除,d.pop是删除,
//d.pop();//删除,
//cout << x << endl; // 输出的是10,
return 0;
}
stack栈
最新推荐文章于 2023-09-26 08:00:00 发布