Stack (stl)

#include<cstdio>
#include<stack>
#include<algorithm>
#include<iostream>
using namespace std;
/////////////////////////// 
typedef int type;
///////////////////////////

///////////////////////////
int main()
{
    stack<type> s1;
    if(s1.empty())
        cout<<"stack is empty now;"<<endl;
//  stack<int>::iterator it = s1.top();//stack and queue dosen't have iterator
    for(int i=1;i<=5;i++)
        s1.push(i);
    cout<<"the size of s1 is "<<s1.size()<<endl;
    while(!s1.empty())
    {
        cout<<s1.top()<<" ";
        s1.pop();
    }
    for(int i=1;i<=5;i++)
        s1.push(i);
    cout<<endl;
    stack <type> s2;
    for(int i=11;i<=20;i++)
        s2.push(i);
    swap(s1,s2);
    cout<<"s1:";
    while(!s1.empty())
    {
        cout<<s1.top()<<" ";
        s1.pop();
    }
    cout<<endl<<"s2:";
    while(!s2.empty())
    {
        cout<<s2.top()<<" ";
        s2.pop();
    }
    cout<<endl;

}

本作品采用《CC 协议》，转载必须注明作者和本文链接