C++_STL_stack_初探2009-03-29 15:47#include<fstream>
#include<iostream>
#include<iterator>
#include<string>
#include<algorithm>
#include<list>
#include<vector>
#include<map>
#include<stack>
using namespace std;
int main()
{
stack<int>a;
//按默认的用deque(双端队列)实现这个stack
a.push(1);
a.push(2);
cout<<a.size()<<endl;
cout<<a.top()<<endl;
a.pop();
cout<<a.top()<<endl;
vector<int> v;
v.push_back(1);
v.push_back(2);
stack<int,vector<int> >b(v);
//用vector实现这个stack
v.clear();
cout<<b.size()<<endl;
cout<<b.top()<<endl;
b.pop();
cout<<b.top()<<endl;
return 0;
}
/*
其实可以采用任何提供back(),push_back(),pop_back(),empty(),size()的序列实现。
比如list
*/